33 search results - page 3 / 7 » Improved Approximation Algorithms for PRIZE-COLLECTING STEIN... |
DAC
2001
ACM
14 years 5 months ago
2001
ACM
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
STOC
2006
ACM
14 years 4 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
STOC
2010
ACM
13 years 9 months 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 ...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
SODA
2000
ACM
13 years 5 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...