Abstract
We investigate the computational complexity of two special cases of the Steiner tree problem where the distance matrix is a Kalmanson matrix or a circulant matrix, respectively. For Kalmanson matrices we develop an efficient polynomial time algorithm that is based on dynamic programming. For circulant matrices we give an \(\mathcal{N}\mathcal{P}\)-hardness proof and thus establish computational intractability.
Similar content being viewed by others
References
G. Christopher, M. Farach, and M. Trick, "The structure of circular decomposable metrics," in Proceedings of ESA IV, Lecture Notes in Computer Science, vol. 1136, Springer Verlag: Berlin, Heidelberg, New York, 1996, pp. 406–418.
P.J. Davis, Circulant Matrices, John Wiley: New York, 1979.
V.G. Deineko, R. Rudolf, and G.J. Woeginger, "Sometimes travelling is easy: The master tour problem," SIAM Journal on Discrete Mathematics, vol. 11, pp. 81–93, 1998.
T. Dud´as, private communication, September 1996.
T. Dud´as, B. Klinz, and G.J. Woeginger, "The computational complexity of Steiner tree problems in graded matrices," Applied Mathematics Letters, vol. 10, pp. 35–39, 1997.
M.R. Garey, R.L. Graham, and D.S. Johnson, "The complexity of computing Steiner minimal trees," SIAM Journal on Applied Mathematics, vol. 32, pp. 835–859, 1977.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, 1979.
P.C. Gilmore, E.L. Lawler, and D.B. Shmoys, "Well-solved special cases," in The Travelling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Eds.), John Wiley: Chichester, 1985, pp. 87–143, chap. 4.
F.K. Hwang, D.S. Richards, and P. Winter, "The Steiner tree problem," Annals of Discrete Mathematics, vol. 53, North-Holland: Amsterdam, 1992.
K. Kalmanson, "Edgeconvex circuits and the travelling salesman problem," Canadian Journal of Mathematics, vol. 27, pp. 1000–1010, 1975.
P.B. Mirchandani and R.L. Francis, Discrete Location Theory, John Wiley: New York, 1990.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Klinz, B., Woeginger, G.J. The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. Journal of Combinatorial Optimization 3, 51–58 (1999). https://doi.org/10.1023/A:1009881510868
Issue Date:
DOI: https://doi.org/10.1023/A:1009881510868