An approximation algorithm for finding long paths in Hamiltonian graphs

Authors:
Sundar Vishwanathan
Affiliations:
Department of Computer Science and Engineering, IIT, Mumbai 400076, India
Venue:
Journal of Algorithms - Special issue: SODA 2000
Year:
2004

Citing 5
Cited 0

Approximating the minimum-degree Steiner tree to within one of optimal

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Color-coding

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Finding a Path of Superlogarithmic Length

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract)

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a polynomial-time algorithm that finds paths of length Ω((log n/ log log n)2) in undirected Hamiltonian graphs, improving the previous best of Ω(log n).