Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

Martin~Gruber, Günther Raidl
January 2009
PDF bib

Abstract

Full Citation:

MartinGruber, GüntherR.~Raidl. Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-D'iaz and others), volume 5717 of LNCS, pages 665-672, 2009, Springer.

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

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