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

Martin Gruber; Günther R. Raidl

by Martin Gruber, Günther R. Raidl

Reference:

Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree ProblemMartin Gruber, Günther R. RaidlExtended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 228–231, 2009.

Bibtex Entry:

@INPROCEEDINGS{gruber-08e,
author          = {Martin~Gruber and Günther~R.~Raidl},
title           = {Cluster-Based (Meta-)Heuristics for the {E}uclidean Bounded Diameter Minimum Spanning Tree Problem},
year            = {2009},
booktitle       = {Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)},
address         = {Gran Canaria, Spain},
editor          = {A. Quesada-Arencibia and others},
pages           = {228--231},
keywords = {netdesign,bdmst},
url = {https://www.ac.tuwien.ac.at/files/pub/gruber-08e.pdf},
}