Approximating the longest cycle problem in sparse graphs

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1596-1607

  Feder, Tomás ^a   Motwani, Rajeev ^a   Subi, Carlos ^a  

^a NONE   (United States)

Author keywords

Approximation algorithms; Hamiltonian graphs; Long paths and cycles

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HAMILTONIANS; PROBLEM SOLVING;

SPARSE GRAPHS;

GRAPH THEORY;

EID: 0036588883     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701395486     Document Type: Article

References (14)

1. N. Alon, R. Yuster, and U. Zwick, Finding and counting given length cycles, Algorithmica, 17 (1997), pp. 209-233.
2. D. Bauer, A. Morgana, E.F. Scheichel, and H.J. Veldman, Long cycles in graphs with large degree sums, Discrete Math., 79 (1989), pp. 59-70.
3. C. Bazgan, M. Santha, and Z. Tuza, On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs, J. Algorithms, 31 (1999), pp. 249-268.
4. J.A. Bondy and M. Simonovits, Longest cycles in 3-connected cubic graphs, Canad. J. Math., 32 (1980), pp. 987-992.
5. V. Chvatal, Hamiltonian cycles, in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.L. Lawler et al., eds., Wiley, Chichester, UK, 1985, pp. 402-430.
6. T. Feder, R. Motwani, and C. Subi, Finding long paths and cycles in sparse Hamiltonian graphs, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 524-529.
7. M. Fürer and B. Raghavachari, Approximating the minimum degree spanning tree to within one from the optimal degree, in Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, 1992, pp. 317-324.
8. M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms, 17 (1994), pp. 409-423.
9. B. Jackson, Longest cycles in 3-connected cubic graphs, J. Combin. Theory Ser. B, 41 (1986), pp. 17-26.
10. D. Karger, R. Motwani, and G.D.S. Ramkumar, On approximating the longest path in a graph, Algorithmica, 18 (1997), pp. 82-98.
11. B. Monien, How to find long paths efficiently, Ann. Discrete Math., 25 (1985), pp. 239-254.
12. N. Robertson and P.D. Seymour, An outline of a disjoint paths algorithm, in Paths, Flows, and VLSI-Layout, N. Korte et al., eds., Springer-Verlag, Berlin, 1990, pp. 267-292.
13. N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), pp. 65-110.
14. S. Vishwanathan, An approximation algorithm for finding a long path in Hamiltonian graphs, in Proceedings of the Eleventh Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000, pp. 680-685.