666 search results - page 27 / 134 » New primal-dual algorithms for Steiner tree problems |
123
click to vote
SODA
1992
ACM
15 years 2 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
LATIN
2010
Springer
15 years 6 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...
120
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
105
click to vote
MOBIHOC
2006
ACM
16 years 25 days 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...
233
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...