Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. The analysis of these randomized search heuristics has been started for some well-known problems, and this approach is followed here for the minimum spanning tree problem. After motivating this line of research, it is shown that randomized search heuristics find minimum spanning trees in expected polynomial time without employing the global technique of greedy algorithms.

Authors

• Frank Neumann The University of Adelaide
• Ingo Wegener

Keywords

• Minimum spanning trees
• Analysis of expected optimization time
• Parallel random search
• ( 1 + λ ) EA