Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem

Günther Raidl
Günther Raidl

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