When the greedy algorithm fails

Discrete Optimization

Volumn 1, Issue 2, 2004, Pages 121-127

  Bang Jensen, Jørgen ^a   Gutin, Gregory ^b   Yeo, Anders ^b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Combinatorial optimization; Greedy algorithm; Traveling salesman problem

Indexed keywords

APPROXIMATION THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; GREEDY ALGORITHMS; NATURAL NUMBERS; ORDERED PARTITIONING;

ALGORITHMS;

EID: 13944276451     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2004.03.007     Document Type: Article

References (12)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation 1999 Springer Berlin
2. L. Engebretsen, and M. Karpinski Approximation hardness of TSP with bounded metrics Lecture Notes in Computer Science Vol. 2076 2001 Springer Berlin 201 212
3. D. Fotakis, G. Pantziou, G. Pentaris, and P. Spirakis Frequency assignment in mobile and radio networks, Networks in distributed computing DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 45 1999 73 90
4. G. Gutin, and A. Yeo Anti-matroids Oper. Res. Lett. 30 2002 97 99
5. G. Gutin, and A. Yeo Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number Discrete Appl. Math. 119 2002 107 116
6. G. Gutin, A. Yeo, and A. Zverovich Traveling salesman should not be greedy domination analysis of greedy-type heuristics for the TSP Discrete Appl. Math. 117 2002 81 86
7. D.S. Johnson, G. Gutin, L. McGeoch, A. Yeo, X. Zhang, and A. Zverovitch Experimental analysis of heuristics for ATSP G. Gutin A. Punnen The Traveling Salesman Problem and its Variations 2002 Kluwer Dordrecht
8. C.H. Papadimitriou, and M. Yannakakis The traveling salesman problem with distances one and two Math. Oper. Res. 18 1993 1 11
9. A. Punnen, and S. Kabadi Domination analysis of some heuristics for the asymmetric traveling salesman problem Discrete Appl. Math. 119 2002
10. A. Punnen, F. Margot, and S. Kabadi TSP heuristics domination analysis and complexity Algorithmica 35 2003 111 127
11. V.I. Sarvanov On the minimization of a linear from on a set of all n -elements cycles, Vestsi Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk 4 1976 17 21 (in Russian)
12. S. Vishwanathan An approximation algorithm for the asymmetric traveling salesman problem with distances one and two Inform. Process. Lett. 44 1992 297 302