- Published 2008 in APJOR
DOI:10.1142/S0217595908001870

Given an undirected, connected, weighted graph, the leaf-constrained minimum spanning tree (LCMST) problem seeks a spanning tree of the graph with smallest weight among all spanning trees of the graph, which contains at least l leaves. In this paper we have proposed two new metaheuristic approaches for the LCMST problem. One is an ant-colony optimization… CONTINUE READING

### Presentations referencing similar topics