Bounds on the quality of approximate solutions to the Group Steiner Problem

@inproceedings{Ihler1990BoundsOT,
  title={Bounds on the quality of approximate solutions to the Group Steiner Problem},
  author={Edmund Ihler},
  booktitle={WG},
  year={1990}
}
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 approximation algorithms have already been proposed, but nothing about the quality of any approximate solution… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Tarjan: Fibonacci Heaps and Their Uses in Improved Networks Optimization Algorithms

  • Ft, M L Fredman
  • Journal of the ACM
  • 1987

Berman: A Fast Algorithm for Steiner Trees

  • R M Karp, Kmb L Kou, G Markowsky
  • Acta Informatica
  • 1972

graphs without Steiner vertices and constant distance function, i.e. all edges have unit length, is as hard as the problem with Steiner vertices and positive rational distance function

  • graphs without Steiner vertices and constant…

Similar Papers

Loading similar papers…