Abstract
Circular decomposable metrics (CDM) are sums of cut metrics that satisfy a circularity condition. A number of combinatorial optimization problems, including the traveling salesman problem, are easily solved if the underlying cost matrix represents a CDM. We give a linear time algorithm for recognizing CDMs and show that they are identical to another class of metrics: the Kalmanson metric.
Supported by an NSF Career Advancement Award and an Alfred P. Sloan Fellowship.
Supported by an Office of Naval Research Young Investigator Award.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson,and M. Thorup. On the Approximability of Numerical Taxonomy — Fitting Distances by Tree Metrics. Symposium on Discrete Algorithms (SODA) '96.
A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
H-J. Bandelt, and A.W.M. Dress, A Canonical Decomposition Theory for Metrics on a Finite Set, Advances in Mathematics, 92 (1992), 47–105.
J-P. Barthélemy and A. Guénoche. Trees and Proximity Representations. Wiley, New York, 1991.
K. S. Booth, and G. S. Lueker, Testing for the Consecutive ones Property, Interval Graphs and Graph Planarity Using PQ-tree Algorithms, Journal of Computer and System Sciences, 13, (1976), 335–379.
G.E. Christopher and M.A. Trick, “Kalmanson and Circular Decomposable Metrics”, GSIA Working Paper Series, 1996 (available at http://mat.gsia.cmu.edu/trick.html).
Corman, Leiserson and Rivest Introduction to Algorithms MIT Press, 1990
V. Deineko, R. Rudolf, and G. Woeginger, Sometimes Traveling is Easy: The Master Tour Problem. Institute of Mathematics, University of Technology, Graz Austria (1995).
C. De Simone, “The Cut Polytope and the Boolean Quadric Polytope”, Discrete Mathematics, 79: 71–75 (1989/1990).
C. De Simone, G. Rinaldi, “A Cutting Plane Algorithm for the Max-Cut Problem”, Optimization Methods and Software, 3: 195–214 (1994).
Deza and M. Laurent, “Applications of cut polyhedra”, Journal of Computational and Applied Mathematics, 55: 191–216 (1994).
P.C. Gilmore, E.L. Lawler, and D.B. Shmoys, “Well-solved special cases”, in [14]: 87–144.
K. Kalmanson, “Edgeconvex circuits and the travelling salesman problem”, Canadian Journal of Mathematics, 27: 1000–1010 (1975).
E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley (1985).
U. Pferschy, R. Rudolf, and G.J. Woeginger, “Monge matrices make maximization manageable”, Operations Research Letters, 16: 245–254 (1994).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christopher, G., Farach, M., Trick, M. (1996). The structure of circular decomposable metrics. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_77
Download citation
DOI: https://doi.org/10.1007/3-540-61680-2_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61680-1
Online ISBN: 978-3-540-70667-0
eBook Packages: Springer Book Archive