Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem

Arindam Khaled, Bryant A. Julstrom
2008 Proceedings of the 10th annual conference on Genetic and evolutionary computation - GECCO '08  
Given an edge-labeled, connected, undirected graph G and a bound r > 1, the bounded minimum-label spanning tree problem seeks a spanning tree on G whose edges carry the fewest possible labels and in which no label appears more than r times. Two greedy heuristics for the unbounded version of the problem are adapted to the bounded version. Two genetic algorithms for the problem encode labeled spanning trees as permutations of G's edges. A simple GA performs poorly, but the addition of local search enables consistently good results.
doi:10.1145/1389095.1389217 dblp:conf/gecco/KhaledJ08 fatcat:fnnvbvxqlfco7ic6ud5galtrg4