Bdmst

Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem
May 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
PDF Cite
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 713-720, 2009, Springer.
PDF Cite
Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem
Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia and others), pages 228-231, 2009.
PDF Cite
Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances
GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl and others), pages 263-270, 2009, ACM Press.
PDF Cite
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 665-672, 2009, Springer.
PDF Cite