Exact algorithms for the Hamiltonian cycle problem in planar graphs

Operations Research Letters

Volumn 34, Issue 3, 2006, Pages 269-274

  Deǐneko, Vladimir G ^a   Klinz, Bettina ^b   Woeginger, Gerhard J ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Combinatorial optimization; Exact algorithm; Hamiltonian cycle; Planar separator theorem

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HAMILTONIANS; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; EXACT ALGORITHM; HAMILTONIAN CYCLE; PLANAR SEPARATOR THEOREM;

ALGORITHMS;

EID: 32644440012     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.04.013     Document Type: Article

References (22)

1. S. Arora, M. Grigni, D.R. Karger, P.N. Klein, A. Woloszyn, A polynomial-time approximation scheme for weighted planar graph TSP, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA'1998), 1998, pp. 33-41.
2. E.T. Bax Inclusion and exclusion algorithm for the Hamiltonian path problem Inform. Process. Lett. 47 1993 203 207
3. L. Cai, and D. Juedes On the existence of subexponential parameterized algorithms J. Comp. Syst. Sci. 67 2003 789 807
4. E.D. Demaine, M.T. Hajiaghayi, Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth, Proceedings of the 12th Symposium on Graph Drawing (GD'2004), Lecture Notes in Computer Science, vol. 3383, Springer, Berlin, 2004, pp. 517-533.
5. R.G. Downey, V. Estivill-Castro, M.R. Fellows, E. Prieto, and F.A. Rosamond Cutting up is hard to do: the parameterized complexity of k-cut and related problems Electron. Notes Theoret. Comp. Sci. 78 2003 1 14
6. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco
7. M.R. Garey, D.S. Johnson, and L. Stockmeyer Some simplified NP-complete graph problems Theoret. Comput. Sci. 1 1976 237 267
8. M.R. Garey, D.S. Johnson, and R.E. Tarjan The planar Hamiltonian circuit problem is NP-complete SIAM J. Comput. 5 1976 704 714
9. R.Z. Hwang, R.C. Chang, and R.C.T. Lee The searching over separators strategy to solve some NP-hard problems in subexponential time Algorithmica 9 1993 398 423
10. R. Impagliazzo, and R. Paturi On the complexity of k-SAT J. Comput. Syst. Sci. 62 2001 367 375
11. R. Impagliazzo, R. Paturi, and F. Zane Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63 2001 512 530
12. A. Itai, C.H. Papadimitriou, and J.L. Swarcfiter Hamiltonian paths in grid graphs SIAM J. Comput. 11 1982 676 686
13. V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Kungliga Tekniska Högskolan, Stockholm, 1992.
14. R.M. Karp Dynamic programming meets the principle of inclusion and exclusion Oper. Res. Lett. 1 1982 49 51
15. R.J. Lipton, and R.E. Tarjan A separator theorem for planar graphs SIAM J. Appl. Math. 36 1979 177 189
16. R.J. Lipton, and R.E. Tarjan Applications of a planar separator theorem SIAM J. Comput. 9 1980 615 627
17. G.L. Miller Finding small simple cycle separators for 2-connected planar graphs J. Comput. Syst. Sci. 32 1986 265 279
18. R. Niedermeier Ubiquitous parameterization - invitation to fixed-parameter algorithms, Proceedings of the 29th Symposium on Mathematical Foundations of Computer Science (MFCS'2004), Lecture Notes in Computer Science, vol. 3153, Springer, Berlin, 2004, pp. 84-103.
19. C.H. Papadimitriou The Euclidean traveling salesman problem is NP-complete Theoret. Comput. Sci. 4 1977 237 244
20. A. Rosenthal Dynamic programming is optimal for nonserial optimization problems SIAM J. Comput. 11 1982 47 59
21. W.D. Smith Studies in computational geometry motivated by mesh generation, Ph.D. Thesis, Princeton University, Princeton, 1988.
22. G.J. Woeginger, Exact algorithms for NP-hard problems: a survey, in: Combinatorial Optimization - Eureka, You Shrink!, Lecture Notes in Computer Science, vol. 2570, Springer, Berlin, 2003, pp. 185-207.