An effective genetic algorithm for the minimum-label spanning tree problem


Given a connected, undirected graph G with labeled edges, the minimum label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible number of labels. A greedy heuristic for this NP-hard problem greedily chooses labels so as to reduce the number of components in the subgraphs they induce as quickly as possible. A… (More)
DOI: 10.1145/1143997.1144097

4 Figures and Tables


  • Presentations referencing similar topics