Abstract
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\).
This is a preview of subscription content, log in via an institution to check access.
References
Á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
Grosso, A., Salassa, F., Vancroonenburg, W.: Searching for a cycle with maximum coverage in undirected graphs. Optim. Lett. 10, 1493–1504 (2016)
Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica 18, 82–98 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Briskorn, D. On approximating maximum covering cycles in undirected graphs. Optim Lett 13, 445–448 (2019). https://doi.org/10.1007/s11590-018-1293-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-018-1293-3