433 search results - page 8 / 87 » A greedy approximation algorithm for the group Steiner probl... |
JISE
2006
13 years 7 months ago
2006
ISPD
2012
ACM
12 years 2 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
STOC
2010
ACM
14 years 7 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...