Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)

European Journal of Operational Research

Volumn 161, Issue 3, 2005, Pages 721-735

  Monnot, Jérôme ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Analysis of algorithms; Approximate algorithms; Combinatorial optimization; Complexity theory; Differential ratio; Hamiltonian paths; Performance ratio

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; OPTIMIZATION; SET THEORY;

ANALYSIS OF ALGORITHMS; APPROXIMATE ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPLEXITY THEORY; DIFFERENTIAL RATIO; HAMILTONIAN PATHS; PERFORMANCE RATIO;

HAMILTONIANS;

EID: 7444240312     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.09.007     Document Type: Article

References (36)

1. Hartigan J.A. Clustering Algorithms. 1975;Wiley, New York.
2. A. Aiello, E. Burattini, M. Massarotti, F. Ventriglia, A new evaluation function for approximation, Sem. IRIA, 1977.
3. Ausiello G., Crescenzi P., Protasi M. Approximate solutions of NP-optimization problems. Theoretical Computer Science. 150:1995;1-55.
4. Ausiello G., D'Atri A., Protasi M. Structure preserving reductions among convex optimization problems. Journal of Computer and System Science. 21:1980;136-153.
5. C. Bazgan, R. Hassin, J. Monnot, Differential approximation for some routing problems (extended abstract), Proc. CIAC 03, LNCS 2653, 2003, pp. 277-288.
6. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical report 338, Grad. School of Industrial Administration, CMU, 1976.
7. Cornuejols G., Fisher M.L., Nemhauser G.L. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science. 23:1977;789-810.
8. P. Crescenzi,V. Kann. A compendium of NP-optimization problems, 2000. Available from 〈 http://www.nada.kth.se/~viggo/problemlist/compendium.html〉.
9. Crescenzi P., Panconesi A. Completeness in approximation classes. Information and Computation. 93:1991;241-262.
10. M. Demange, D. De Werra, J. Monnot, V.Th. Paschos, Weighted node coloring: when stable sets are expensive (extended abstract), Proc. WG 02, LNCS 2573, 2002, pp. 114-125.
11. Demange M., Grisoni P., Paschos V.Th. Differential approximation algorithms for some combinatorial optimization problems. Theoretical Computer Science. 209:1998;107-122.
12. Demange M., Monnot J., Paschos V.Th. Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Applied Mathematics Letters. 12:1999;127-133.
13. Demange M., Paschos V.Th. On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science. 158:1996;117-141.
14. L. Engebretsen, M. Karpinski, Approximation hardness of TSP with bounded metrics, 2002. Available from 〈 http://www.nada.kth.se/~enge/enge-bib〉.
15. Fisher M.L., Nemhauser G.L., Wolsey L.A. An analysis of approximations for finding a maximum weight hamiltonian circuit. Operations Research. 27(4):1979;799-809.
16. Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-completeness. 1979;Freeman, CA.
17. Garfinkel R.S. Motivation and modeling. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. 1985;17-36 Wiley, Chichester.
18. Guttmann-Beck N., Hassin R., Khuller S., Raghavachari B. Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica. 28(4):2000;422-437.
19. Haimovich M., Rinnooy Kan A.H.G. Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research. 10(5):1985;527-542.
20. Hassin R., Khuller S. z -approximations Journal of Algorithm. 41(2):2001;429-442.
21. Hassin R., Rubinstein S. Better approximation for max TSP. Information Processing Letters. 75:2000.
22. Hoogeveen J.A. Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Operations Research Letters. 10:1991;291-295.
23. Johnson D.S., Papadimitriou C.H. Performance guarantees for heuristics. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. 1998;145-180 Wiley, Chichester.
24. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York.
25. Kosaraju R., Park J., Stein C. Tours and short superstrings. Proc. FOCS. 11(4):1994;166-177.
26. Lawler E.L., Lenstra J.K., Rinooy Kan A.H.G., Shmoys D.B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. 1985;Wiley, New York.
27. Monnot J. Differential approximation of NP-hard problems with constant size feasible solutions. RAIRO/Operations Research. 36(4):2002;279-297.
28. Monnot J. The maximum. f -depth spanning tree problem Information Processing Letters. 80:2001;179-187.
29. Monnot J. Approximation results toward nearest neighbor heuristic. Yugoslav Journal of Operations Research. 12(1):2002;11-16.
30. P. Orponen, H. Mannila, On approximation preserving reductions: complete problems and robust measures, Technical report, Department of Computer Science, University of Helsinki, 1987.
31. Papadimitriou C.H., Yannakakis M. The traveling salesman problem with distance one and two. Mathematics of Operations Research. 18:1993;1-11.
32. Paz A., Moran S. Non deterministic polynomial optimisation problems and their approximation. Theoretical Computer Science. 95:1981;251-277.
33. Sahni S., Gonzalez T. P-complete approximation problems. Journal of ACM. 23:1976;555-565.
34. Tarhio J., Ukkonen E. A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science. 57:1988;131-145.
35. Vavasis S.A. Approximation algorithms for indefinite quadratic programming. Mathematical Programming. 57:1972;279-311.
36. Zemel E. Measuring the quality of approximate solutions to zero-one programming problems. Mathematics of Operations Research. 6:1981;319-332.