Skip to main content
SpringerLink
Log in

Searching for a cycle with maximum coverage in undirected graphs

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The present contribution considers the problem of identifying a simple cycle in an undirected graph such that the number of nodes in the cycle or adjacent to it, is maximum. This problem is denoted as the Maximum Covering Cycle Problem and it is shown to be NP-complete. We present an iterative procedure that, although it cannot be shown to be polynomial, yields (in practice) high-quality solutions within reasonable time on graphs of moderate density.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Colbourn, C.J., Keil, J.M., Stewart, L.K.: Finding minimum dominating cycles in permutation graphs. Oper. Res. Lett. 4, 13–17 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Current, J.R., Schilling, D.A.: The Covering Salesman Problem. Transp. Sci. 23, 208–213 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fischetti, M., Lodi, A.: Local branching. Math. Prog. 98, 23–47 (2003)

  4. Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than \(2^n\). Algorithmica 52, 153–166 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gendreau, M., Laporte, G., Semet, F.: The covering tour problem. Oper. Res. 45, 568–576 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Golden, B., Zahra, N.-A., Raghavan, S., Salari, M., Toth, P.: The generalized Covering Salesman Problem. INFORMS J. Comput. 24(4), 534–553 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hamiltonian Cycle problem. NP Datalog. http://wwwinfo.deis.unical.it/npdatalog/experiments/hamiltoniancycle.htm. Accessed 8 April 2013

  9. Hanafi, S., Wilbaut, C.: Improved convergent heuristics for the 0–1 multidimensional knapsack problem. Ann. OR 183(1), 125–142 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lesniak-Foster, L., Williamson, J.E.: On spanning and dominating circuits in graphs. Can. Bull. Math. 20, 215–220 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  11. OR Library. http://people.brunel.ac.uk/~mastjjb/jeb/info.html

  12. Pferschy, U., Stanĕk, R.: Generating subtour constraints for the TSP from pure integer solutions. Optimization Online. http://www.optimization-online.org/DB_HTML/2014/02/4258.html

  13. Veldman, H.J.: Existence of dominating cycles and paths. Discret. Math. 43, 281–296 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  14. Veldman, H.J.: On dominating and spanning circuits in graphs. Discret. Math. 124, 229–239 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research was partially funded by a Ph.D. grant of the agency for Innovation by Science and Technology (IWT).

Author information

Authors and Affiliations

  1. Dip. di Informatica, Università di Torino, Turin, Italy

    Andrea Grosso

  2. DAI, Politecnico di Torino, Turin, Italy

    Fabio Salassa

  3. Department of Computer Science, CODeS & iMinds-ITEC, KU Leuven, Louvain, Belgium

    Wim Vancroonenburg

Authors
  1. Andrea Grosso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Salassa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wim Vancroonenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrea Grosso.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Grosso, A., Salassa, F. & Vancroonenburg, W. Searching for a cycle with maximum coverage in undirected graphs. Optim Lett 10, 1493–1504 (2016). https://doi.org/10.1007/s11590-015-0952-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0952-x

Keywords

Search

Navigation