### 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 finding 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, and the quality of the solution is measured by cycle length. 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 finding a second cycle in cubic Hamiltonian graphs if a Hamiltonian cycle is given in the input.

Original language | English |
---|---|

Pages (from-to) | 249-268 |

Number of pages | 20 |

Journal | Journal of Algorithms |

Volume | 31 |

Issue number | 1 |

DOIs | |

Publication status | Published - Apr 1999 |

### ASJC Scopus subject areas

- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs'. Together they form a unique fingerprint.

## Cite this

*Journal of Algorithms*,

*31*(1), 249-268. https://doi.org/10.1006/jagm.1998.0998