by Martin Gruber, Günther R. Raidl
Reference:
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)HeuristicsMartin Gruber, Günther R. RaidlComputer Aided Systems Theory – EUROCAST 2009 (R. Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 665–672, 2009, Springer.
Bibtex Entry:
@INPROCEEDINGS{gruber-08e2,
author = {Martin~Gruber and Günther~R.~Raidl},
title = {Solving the {E}uclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics},
year = {2009},
booktitle = {Computer Aided Systems Theory -- EUROCAST 2009},
publisher = {Springer},
series = {LNCS},
volume = 5717,
pages = {665--672},
editor = {R.~Moreno-D\'iaz and others},
keywords = {netdesign,bdmst},
url = {https://www.ac.tuwien.ac.at/files/pub/gruber-08e2.pdf},
}