509 search results - page 1 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
NETWORKS
2006
13 years 11 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...
WG
2001
Springer
14 years 3 months ago
2001
Springer
MFCS
2001
Springer
14 years 3 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
SODA
2003
ACM
14 years 8 days 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...
CCCG
2007
14 years 11 days ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...