632 search results - page 34 / 127 » On the Approximability of the Steiner Tree Problem |
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
82
Voted
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
110
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
ICCAD
1995
IEEE
15 years 3 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...