| | |
Summary: Distinguished
2006
Series
The Minimum Label Spanning Tree
Problem: Illustrating the Power and
Flexibility of Genetic Algorithms
BRUCE L. GOLDEN
Wednesday, April 5, 2006
12:00 PM - 1:00 PM
Given a connected, undirected graph G whose edges
are labeled (or colored), the minimum label spanning
tree (MLST) problem seeks a spanning tree on G with
the minimum number of distinct labels (or colors).
The MLST problem is motivated by applications in
communications network design. It is easy to
understand and yet it is a difficult problem to
solve optimally.
The MLST has been shown to be NP-hard and an
effective heuristic has been proposed and analyzed. In
addition, metaheuristics (including genetic
|
