The structure of circular decomposable metrics

  • George Christopher
  • Martin Farach
  • Michael Trick
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)


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.


Travel Salesman Problem Travel Salesman Problem Hamiltonian Path Interval Graph Degree Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    J-P. Barthélemy and A. Guénoche. Trees and Proximity Representations. Wiley, New York, 1991.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    G.E. Christopher and M.A. Trick, “Kalmanson and Circular Decomposable Metrics”, GSIA Working Paper Series, 1996 (available at Scholar
  7. 7.
    Corman, Leiserson and Rivest Introduction to Algorithms MIT Press, 1990Google Scholar
  8. 8.
    V. Deineko, R. Rudolf, and G. Woeginger, Sometimes Traveling is Easy: The Master Tour Problem. Institute of Mathematics, University of Technology, Graz Austria (1995).Google Scholar
  9. 9.
    C. De Simone, “The Cut Polytope and the Boolean Quadric Polytope”, Discrete Mathematics, 79: 71–75 (1989/1990).Google Scholar
  10. 10.
    C. De Simone, G. Rinaldi, “A Cutting Plane Algorithm for the Max-Cut Problem”, Optimization Methods and Software, 3: 195–214 (1994).Google Scholar
  11. 11.
    Deza and M. Laurent, “Applications of cut polyhedra”, Journal of Computational and Applied Mathematics, 55: 191–216 (1994).Google Scholar
  12. 12.
    P.C. Gilmore, E.L. Lawler, and D.B. Shmoys, “Well-solved special cases”, in [14]: 87–144.Google Scholar
  13. 13.
    K. Kalmanson, “Edgeconvex circuits and the travelling salesman problem”, Canadian Journal of Mathematics, 27: 1000–1010 (1975).Google Scholar
  14. 14.
    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).Google Scholar
  15. 15.
    U. Pferschy, R. Rudolf, and G.J. Woeginger, “Monge matrices make maximization manageable”, Operations Research Letters, 16: 245–254 (1994).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • George Christopher
    • 1
  • Martin Farach
    • 2
  • Michael Trick
    • 3
  1. 1.School of MathematicsCarnegie Mellon UniversityUSA
  2. 2.Department of Computer ScienceRutgers UniversityGermany
  3. 3.Graduate School of Industrial AdministrationCarnegie Mellon UniversityUSA

Personalised recommendations