Abstract
It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP-hard in general, and no polynomial time algorithm is known for the problem of fording a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the complexity of approximating this problem where by a feasible solution we mean a(nother) cycle in the graph. First we prove a negative result showing that the LONGEST PATH problem is not constant approximable in cubic Hamiltonian graphs unless P = NP. No such negative result was previously known for this problem in Hamiltonian graphs. In strong opposition with this result we show that there is a polynomial time approximation scheme for fording another cycle in cubic Hamiltonian graphs if a Hamiltonian cycle is given in the input.
This research was supported by the ESPRIT Working Group RAND2 n° 21726 and by the bilateral project Balaton, grant numbers 97140 (APAPE, France) and F-36/96 (TéT Alapítvány, Hungary)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proc. of 33rd FOGS, pages 14–23, 1992.
N. Alon, R. Yuster, U. Zwick, Color-coding: anew method for finding simple paths, cycles and other small subgraphs within large graphs, Proc. of 26th STOC, pages 326–335, 1994.
R. P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. (2) 51 (1950), 161–166.
M. Fürer, B. Raghavachari, Approximating the Minimum-Degree Steiner Tree to within One of Optimal, Journal of Algorithms, 17, pages 409–423, 1994.
G. Galbiati, A. Morzenti, F. Maffioli, On the Approximability of some Maximum Spanning Tree Problems, to appear in Theoretical Computer Science.
M. R. Garey, D. S. Johnson, R. E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput. 5:4, pages 704–714, 1976.
R. M. Karp, Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher editors, Complexity of Computer Computations, pages 85–103, 1972.
D. Karger, R. Motwani, G. Ramkumar, On Approximating the Longest Path in a Graph, Proc. of 3rd Workshop on Algorithms and Data Structures, LNCS 709, pages 421–432, 1993.
N. Megiddo, C. Papadimitriou, On total functions, existence theorems and computational complexity, Theoretical Computer Science, 81, pages 317–324, 1991.
B. Monien, How to find long paths efficiently, Annals of Discrete Mathematics, 25, pages 239–254, 1984.
C. Papadimitriou, On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence, Journal of Computer and System Science 48, pages 498–532, 1994.
C. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
C. Papadimitriou, M. Yannakakis, Optimization, Approximation and Complexity Classes, Journal of Computer and System Science 43, pages 425–440, 1991.
C. Papadimitriou, M. Yannakakis, The traveling salesman problem with distances one and two, Mathematics of Operations Research, vol. 18, No. 1, pages 1–11, 1993.
A. Thomason, Hamilton cycles and uniquely edge colourable graphs, Ann. Discrete Math. 3, pages 259–268, 1978.
M. Yannakakis, personal communication, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Bazgan, C., Santha, M., Tuza, Z. (1998). On the approximation of finding A(nother) Hamiltonian cycle in cubic Hamiltonian graphs. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028567
Download citation
DOI: https://doi.org/10.1007/BFb0028567
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive