Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
نویسندگان
چکیده
The Steiner tree problem asks for a shortest subgraph connecting a given set of terminals in a graph. It is known to be APX-complete, which means that no polynomial time approximation scheme can exist for this problem, unless P=NP. Currently, the best approximation algorithm for the Steiner tree problem has a performance ratio of + , , whereas the corresponding lower bound is smaller than + , . + . In this paper, we provide for several Steiner tree approximation algorithms lower bounds on their performance ratio that are much larger. For two algorithms that solve the Steiner tree problem on quasi-bipartite instances, we even prove lower bounds that match the upper bounds. Quasi-bipartite instances are of special interest, as currently all known lower bound reductions for the Steiner tree problem in graphs produce such instances.
منابع مشابه
Primal-dual approaches to the Steiner problem
. We study several old and new algerithms for computing lower and upper bounds for the Steiner problem in networks using dual-ascent and primal-dual strategies. These strategies have been proven to be very useful. for the algorithmic treatment of the Steiner problem. We show that none of the known algorithms can both generate tight lower bounds empirically and guarantee their quality theoretica...
متن کاملOptimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP
Given a metric space on n points, an α-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of vertices containing the root, the expected cost of the induced subtree is within an α factor of the optimal Steiner tree cost for X . An α-approximate differentially private algorithm for the Steiner tree problem take...
متن کاملOptimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs
Given a metric space on n points, an α-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of vertices containing the root, the expected cost of the induced subtree is within an α factor of the optimal Steiner tree cost for X. An α-approximate differentially private algorithm for the Steiner tree problem takes...
متن کاملBounds on the quality of approximate solutions to the Group Steiner Problem
The Group Steiner Problem (GSP) is a generalized version of the well known Steiner Problem. For an undirected, connected distance graph with groups of required vertices and Steiner vertices, GSP asks for a shortest connected subgraph, containing at least one vertex of each group. As the Steiner Problem is NP-hard, GSP is too, and we are interested in approximation algorithms. EEcient approximat...
متن کاملApproximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees
We give a new lower bound on the length of the minimal Steiner tree with a given topology joining given terminals in Euclidean space, in terms of toroidal images. The lower bound is equal to the length when the topology is full. We use the lower bound to prove bounds on the “error” e in the length of an approximate Steiner tree, in terms of the maximum deviation d of an interior angle of the tr...
متن کامل