On approximating maximum covering cycles in undirected graphs
We consider the problem to find a cycle in an undirected graph such that a maximum number of nodes is in the cycle or adjacent to a node in the cycle. The problem is known to be NP-hard and we strengthen this result by showing that there is no constant factor approximation algorithm unless \(P=NP\).
KeywordsUndirected graphs Maximum covering cycle Approximation
- 1.Álvarez-Miranda, E., Sinnl, M.: A branch-and-cut algorithm for the maximum covering cycle problem. Ann. Oper. Res. https://doi.org/10.1007/s10479-018-2856-5