Given a graph (Formula presented.) and a coloring function (Formula presented.), that assigns a color to each edge of G from a finite color set L, the rainbow spanning forest problem (RSFP) consists of finding a rainbow spanning forest of G such that the number of components is minimum. A spanning forest is rainbow if all its components (trees) are rainbow. A component whose edges have all different colors is called rainbow component. The RSFP on general graphs is known to be NP-complete. In this paper we use the 3-SAT Problem to prove that the RSFP is NP-complete on trees and we prove that the problem is solvable in polynomial time on paths, cycles and if the optimal solution value is equal to 1. Moreover, we provide an approximation algorithm for the RSFP on trees and we show that it approximates the optimal solution within 2.
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/s11590-017-1161-6|
|Codice identificativo Scopus:||2-s2.0-85021130770|
|Titolo:||On the complexity of rainbow spanning forest problem|
|Appare nelle tipologie:||1.1 Articolo in rivista|