On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs

Journal of Algorithms

Volumn 31, Issue 1, 1999, Pages 249-268

  Bazgan, Cristina ^a   Santha, Miklos ^b   Tuza, Zsolt ^c  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CNRS   (France)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011248715     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0998     Document Type: Article

References (18)

1. S. Arora, C. Lund, C. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, "Proc. of 33rd FOCS, 1992," pp. 14-23.
2. N. Alon, R. Yuster, and U. Zwick, Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs, Proc. of 26th STOC, 1994, 326-335.
3. K. Cameron, Krawczyk's graphs show Thomason's algorithm for finding a second Hamilton cycle through a given edge in a cubic graph is exponential, Fifth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, July 1998.
4. M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms 17 (1994), 409-423.
5. G. Galbiati, A. Morzenti, and F. Maffioli, On the Approximability of some Maximum Spanning Tree Problems, Theoret. Comput. Sci. 181(1), 1997, 107-118.
6. M. R. Garey, D. S. Johnson, and R. E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput. 5:4 (1976), 704-714.
7. R. M. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations" (R. E. Miller and J. W. Thatcher, Eds.), pp. 85-103, Plenum, New York, 1972.
8. D. Karger, R. Motwani, and G. Ramkumar, On Approximating the Longest Path in a Graph, Algorithmica 18 (1997), 82-98.
9. A. Krawczyk, A note on the complexity of finding a second Hamiltonian cycle in cubic graphs, preprint, December 1995.
10. N. Megiddo and C. Papadimitriou, On total functions, existence theorems and computational complexity, Theoretical Computer Science 81 (1991), 317-324.
11. B. Monien, How to find long paths efficiently, Ann. Discrete Math. 25 (1984), 239-254.
12. C. Papadimitriou, On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence, J. Comput. System Sci. 48 (1994), 498-532.
13. C. Papadimitriou and K. Steiglitz, "Combinatorial Optimization: Algorithms and Complexity," Prentice-Hall, Englewood Cliffs, NJ, 1982.
14. C. Papadimitriou and M. Yannakakis, Optimization, Approximation and Complexity Classes, J. Comput. System Sci. 43 (1991), 425-440.
15. C. Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two, Math. Oper. Res. 18(1), 1993, 1-11.
16. A. Thomason, Hamiltonian cycles and uniquely edge colourable graphs, Ann. Discrete Math. 3 (1978), 259-268.
17. W. T. Tutte, On Hamiltonian circuits, J. London Math. Soc. 21 (1946), 98-101.
18. M. Yannakakis, personal communication, 1996.