Abstract
In this chapter, we will present constant factor algorithms for two fundamental problems, metric Steiner tree and metric TSP. The reasons for considering the metric case of these problems are quite different. For Steiner tree, this is the core of the problem — the rest of the problem reduces to this case. For TSP, without this restriction, the problem admits no approximation factor, assuming P ≠ NP. The algorithms, and their analyses, are similar in spirit, which is the reason for presenting these problems together.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
R. Courant and H. Robbins. What Is Mathematics? Oxford University Press, New York, NY, 1941.
F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem, volume 53 of Annals of Discrete Mathematics. North-Holland, Amsterdam, Netherlands, 1992.
P. Schreiber. On the history of the so-called Steiner Weber problem. Wiss. Z. Ernst-Moritz-Arndt-Univ. Greifswald, Math.-nat.wiss. Reihe, 35, 3, 1986.
E.-A. Choukhmane. Une heuristique pour le problème de l’arbre de Steiner. RAIRO Rech. Opér., 12: 207–212, 1978.
A. Iwainsky, E. Canuto, O. Taraszow, and A. Villa. Network decomposition for the optimization of connection structures. Networks, 16: 205–235, 1986.
L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Informatica, 15: 141–145, 1981.
J. Plesnik. A bound for the Steiner tree problem in graphs. Math. Slovaca, 31: 155–163, 1981.
N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
S.K. Sahni and T.F. Gonzalez. P-complete approximation problems. Journal of the ACM, 23: 555–565, 1976.
M. Charikar, J. Kleinberg, R. Kumar, S. Rajagopalan, A. Sahai, and A. Tomkins Minimizing wirelength in zero and bounded skew clock trees. In Proc. 10th ACM-SIAM Annual Symposium on Discrete Algorithms, pages 177–184, 1999.
A.Z. Zelikovsky and I. I. Mândoiu. Practical approximation algorithms for zero-and bounded-skew trees. In Proc. 12th ACM-SIAM Annual Symposium on Discrete Algorithms, pages 407–416, 2001.
D.Z. Du and F.K. Hwang. Gilbert-Pollack conjecture on Steiner ratio is true. Algorithmica, 7: 121–135, 1992.
E.N. Gilbert and H.O. Pollak. Steiner minimal trees. SIAM Journal on Applied Mathematics, 16: 1–29, 1968.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). Steiner Tree and TSP. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive