Sometimes travelling is easy: The master tour problem

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 1, 1998, Pages 81-93

  Deǐneko, Vladimir G ^a   Rudolf, Rüdiger ^a   Woeginger, Gerhard J ^a  

^a Inst fur Mathematik B   (Austria)

Author keywords

Combinatorial optimization; Kalmanson condition; Master tour; Travelling salesman problem

Indexed keywords

EID: 0042522348     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0895480195281878     Document Type: Article

References (9)

1. K. S. BOOTH AND G. S. LUEKER, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
2. R. E. BURKARD, B. KLINZ, AND R. RUDOLF, Perspectives of Monge properties in optimization, Discrete Appl. Math., 70 (1996), pp. 95-161.
3. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
4. V. G. DEǏNEKO AND V. L. FILONENKO, On the Reconstruction of Specially Structured Matrices, Aktualnyje Problemy EVM i programmirovanije, Dnepropetrovsk, DGU, 1979 (in Russian).
5. P. C. GILMORE, E. L. LAWLER, AND D. B. SHMOYS, Well-solved special cases, in The Travelling Salesman Problem, John Wiley, Chichester, 1985, Chapter 4, pp. 87-143.
6. K. KALMANSON, Edgeconvex circuits and the travelling salesman problem, Canad. J. Math., 27 (1975), pp. 1000-1010.
7. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, The Travelling Salesman Problem, John Wiley, Chichester, 1985.
8. C. H. PAPADIMITRIOU, Lecture on computational complexity at the Maastricht Summer School on Combinatorial Optimization, Maastricht, the Netherlands, August, 1993.
9. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.