Abstract
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. Efficient approximation algorithms have already been proposed, but nothing about the quality of any approximate solution is known so far. Especially for the VLSI design application of the problem, bounds on the quality of approximate solutions are of great importance.
We present a simple polynomial time approximation algorithm that computes a tree with no more than g − 1 times the length of a minimal tree, where g is the number of required groups. In addition, we propose an extended version of this algorithm, trading quality of the solution for computation time. Here, one extreme is just our proposed approximation, and the other is an optimal solution. Moreover, we will prove the quality bound g − 1 for a modification of an efficient approximation algorithm proposed in the literature.
Preview
Unable to display preview. Download preview PDF.
References
S. E. Dreyfus, R. A. Wagner: The Steiner Problem in Graphs, Networks, Vol. 1, 1971, 195–207.
M. L. Fredman, R. E. Tarjan: Fibonacci Heaps and Their Uses in Improved Networks Optimization Algorithms, Journal of the ACM, Vol. 34, 1987, 596–615.
M. R. Garey, D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
R. M. Karp: Reducibility among Combinatorial Problems, Complexity of Computer Computations, New York, 1972, 85–103.
L. Kou, G. Markowsky, L. Berman: A Fast Algorithm for Steiner Trees, Acta Informatica, Vol. 15, 1981, 141–145.
K. Mehlhorn: A Faster Approximation Algorithm for the Steiner Problem in Graphs, Information Processing Letters, Vol. 27, 1988, 125–128.
G. Reich, P. Widmayer: Beyond Steiner's problem: A VLSI oriented generalization, 15th International Workshop on Graph-Theoretic Concepts in Computer Science, Castle Rolduc, 1989.
G. Reich, P. Widmayer: Approximate Minimum Spanning Trees for Vertex Classes, Technical Report, Institut für Informatik, Universität Freiburg, Rheinstraße 10–12, 7800 Freiburg, West Germany
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ihler, E. (1991). Bounds on the quality of approximate solutions to the group Steiner problem. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-53832-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53832-5
Online ISBN: 978-3-540-46310-8
eBook Packages: Springer Book Archive