Skip to main content
SpringerLink
Log in

A new approach for the rainbow spanning forest problem

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Given an edge-colored graph G, a tree with all its edges with different colors is called a rainbow tree. The rainbow spanning forest (RSF) problem consists of finding a spanning forest of G, with the minimum number of rainbow trees. In this paper, we present an integer linear programming model for the RSF problem that improves a previous formulation for this problem. A GRASP metaheuristic is also implemented for providing fast primal bounds for the exact method. Computational experiments carried out over a set of random instances show the effectiveness of the strategies adopted in this work, solving problems in graphs with up to 100 vertices.

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
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. https://www.geekbench.com/geekbench3, [accessed 16-May-2018].

References

  • Brualdi RA, Hollingsworth S (2001) Multicolored forests in complete bipartite graphs. Discret Math 240(1–3):239–245

    Article  MathSciNet  Google Scholar 

  • Carraher JM, Hartke SG, Horn P (2016) Edge-disjoint rainbow spanning trees in complete graphs. Eur J Comb 57:71–84

    Article  MathSciNet  Google Scholar 

  • Carrabs F, Cerrone C, Cerulli R, Silvestri S (2018a) On the complexity of rainbow spanning forest problem. Optim Lett 12:443–454

    Article  MathSciNet  Google Scholar 

  • Carrabs F, Cerrone C, Cerulli R, Silvestri S (2018b) The rainbow spanning forest problem. Soft Comput 22(8):2765–2776

    Article  Google Scholar 

  • Hansen P, Mladenovic N (2001) Variable neighbourhood search: principles and applications. Eur J Oper Res 120:449–467

    Article  Google Scholar 

  • Hassin R, Monnot J, Segev D (2007) Approximation algorithms and hardness results for labeled connectivity problems. J Comb Optim 14(4):437–453

    Article  MathSciNet  Google Scholar 

  • Kano M, Li X (2008) Monochromatic and heterochromatic subgraphs in edge-colored graphs-a survey. Graphs Comb 24(4):237–263

    Article  MathSciNet  Google Scholar 

  • Krumke SO, Wirth HC (1998) On the minimum label spanning tree problem. Inf Process Lett 66(2):81–85

    Article  MathSciNet  Google Scholar 

  • Lai X, Zhou Y, He J, Zhang J (2014) Performance analysis of evolutionary algorithms for the minimum label spanning tree problem. IEEE Trans Evol Comput 18(6):860–872

    Article  Google Scholar 

  • Li X, Zhang X (2007) On the minimum monochromatic or multicolored subgraph partition problems. Theor Comput Sci 385(1–3):1–10

    Article  MathSciNet  Google Scholar 

  • Moreno J, Martins S, Frota Y (2019) A note on the rainbow cycle cover problem. Networks 73(1):38–47

    Article  Google Scholar 

  • Resende MG, Ribeiro CC (2016) Optimization by GRASP. Springer, Berlin

    Book  Google Scholar 

  • Silvestri S, Laporte G, Cerulli R (2016) The rainbow cycle cover problem. Networks 68(4):260–270

    Article  MathSciNet  Google Scholar 

  • Suzuki K (2006) A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph. Graphs and Combinatorics 22(2):261–269

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This study was funded by Conselho Nacional de Desenvolvimento Científico e Tecnológico. Award numbers for authors in the order they appear: 870038/2002-8, 305889/2015-0 and 301254/2015-0.

Author information

Authors and Affiliations

  1. Universidade Federal Fluminense, Av. Gal. Milton Tavares de Souza, s/n - São Domingos, Niterói, RJ, 24210-310, Brazil

    Jorge Moreno, Simone Martins & Yuri Frota

Authors
  1. Jorge Moreno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simone Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuri Frota
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jorge Moreno.

Ethics declarations

Conflict of interest

All authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Moreno, J., Martins, S. & Frota, Y. A new approach for the rainbow spanning forest problem. Soft Comput 24, 3771–3780 (2020). https://doi.org/10.1007/s00500-019-04145-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04145-6

Keywords

Search

Navigation