Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

Günther Raidl, B. A. Julstrom
January 2003
PDF bib

Abstract

Full Citation:

G. R. Raidl, B. A. Julstrom. Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont and others), pages 747-752, 2003, ACM Press.

Type
Conference Paper
Evolcomp Netdesign
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.