A new approach for the rainbow spanning forest problem

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.

[1]  Celso C. Ribeiro,et al.  Optimization by GRASP , 2016 .

[2]  Richard A. Brualdi,et al.  Multicolored forests in complete bipartite graphs , 2001, Discret. Math..

[3]  Xueliang Li,et al.  On the minimum monochromatic or multicolored subgraph partition problems , 2007, Theor. Comput. Sci..

[4]  Sven Oliver Krumke,et al.  On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..

[5]  Kazuhiro Suzuki.  A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph , 2006, Graphs Comb..

[6]  Xueliang Li,et al.  Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey , 2008, Graphs Comb..

[7]  Raffaele Cerulli,et al.  The rainbow spanning forest problem , 2018, Soft Comput..

[8]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[9]  Yuren Zhou,et al.  Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem , 2014, IEEE Transactions on Evolutionary Computation.

[10]  Gilbert Laporte,et al.  The Rainbow Cycle Cover Problem , 2016, Networks.

[11]  Raffaele Cerulli,et al.  On the complexity of rainbow spanning forest problem , 2018, Optim. Lett..

[12]  James M. Carraher,et al.  Edge-disjoint rainbow spanning trees in complete graphs , 2016, Eur. J. Comb..

[13]  Refael Hassin,et al.  Approximation algorithms and hardness results for labeled connectivity problems , 2007, J. Comb. Optim..

[14]  Jorge Moreno,et al.  A note on the rainbow cycle cover problem , 2019, Networks.