265 search results - page 7 / 53 » Algorithms for Terminal Steiner Trees |
IPL
2010
13 years 5 months ago
2010
NETWORKS
2006
13 years 7 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
SODA
2003
ACM
13 years 8 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
ICALP
2009
Springer
14 years 7 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...