An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

@inproceedings{Raidl2000AnEE,
  title={An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem},
  author={G{\"u}nther R. Raidl},
  year={2000}
}
The representation of candidate solutions and the variation operators are fundamental design choices in an evolutionary algorithm (EA). This paper proposes a novel representation technique and suitable variation operators for the degree-constrained minimum spanning tree problem. For a weighted, undirected graphG(V, E), this problem seeks to identify the shortest spanning tree whose node degrees do not exceed an upper bound d ≥ 2. Within the EA, a candidate spanning tree is simply represented by… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS