The structure of circular decomposable metrics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 486-500

  Christopher, George ^a   Farach, Martin ^b   Trick, Michael ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; COST MATRICES; LINEAR-TIME ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 84876295186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_77     Document Type: Conference Paper

References (15)

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