An approximation algorithm for the longest cycle problem in solid grid graphs

Although, the Hamiltonicity of solid grid graphs are polynomial-time decidable, the complexity of the longest cycle problem in these graphs is still open. In this paper, by presenting a linear-time constant-factor approximation algorithm, we show that the longest cycle problem in solid grid graphs is in APX. More precisely, our algorithm finds a cycle of length at least $\frac{2n}{3}+1$ in 2-connected $n$-node solid grid graphs. Keywords: Longest cycle, Hamiltonian cycle, Approximation algorithm, Solid grid graph.

[1]  Christopher Umans,et al.  Hamiltonian cycles in solid grid graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[2]  Yong-Jin Liu,et al.  Approximating the longest paths in grid graphs , 2011, Theor. Comput. Sci..

[3]  Ryuhei Uehara,et al.  On Computing Longest Paths in Small Graph Classes , 2007, Int. J. Found. Comput. Sci..

[4]  Xingxing Yu,et al.  Approximating Longest Cycles in Graphs with Bounded Degrees , 2006, SIAM J. Comput..

[5]  Baruch Schieber,et al.  Further Improvements in Competitive Guarantees for QoS Buffering , 2004, ICALP.

[6]  Derek G. Corneil,et al.  A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs , 2010, SIAM J. Discret. Math..

[7]  Harold N. Gabow,et al.  Finding a long directed cycle , 2004, SODA '04.

[8]  David R. Karger,et al.  On approximating the longest path in a graph , 1997, Algorithmica.

[9]  Noga Alon,et al.  Color-coding , 1995, JACM.

[10]  Gregory Gutin,et al.  Finding a Longest Path in a Complete Multipartite Digraph , 1993, SIAM J. Discret. Math..

[11]  Sanjeev Khanna,et al.  Approximating Longest Directed Paths and Cycles , 2004, ICALP.

[12]  A. J. M. van Gasteren,et al.  On computing a longest path in a tree , 2002, Inf. Process. Lett..

[13]  Ryuhei Uehara,et al.  Efficient Algorithms for the Longest Path Problem , 2004, ISAAC.

[14]  Harold N. Gabow,et al.  Finding paths and cycles of superpolylogarithmic length , 2004, STOC '04.

[15]  Harold N. Gabow,et al.  Finding Long Paths, Cycles and Circuits , 2008, ISAAC.

[16]  Andreas Björklund,et al.  Finding a Path of Superlogarithmic Length , 2002, ICALP.

[17]  Rajeev Motwani,et al.  Finding large cycles in Hamiltonian graphs , 2005, SODA '05.

[18]  Asghar Asgharian-Sardroud,et al.  A linear-time algorithm for the longest path problem in rectangular grid graphs , 2012, Discret. Appl. Math..

[19]  Stavros D. Nikolopoulos,et al.  The Longest Path Problem Is Polynomial on Interval Graphs , 2009, MFCS.

[20]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..