Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances

Gruber, Martin; Raidl, Günther R.

by Martin Gruber, Günther R. Raidl

Reference:

Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean InstancesMartin Gruber, Günther R. RaidlGECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), pages 263–270, 2009, ACM Press.

Bibtex Entry:

@INPROCEEDINGS{gruber:09,
  author	= {Martin Gruber and G\"unther R. Raidl},
  title		= {Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on {E}uclidean Instances},
  booktitle = {GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation},
  editor	= {G\"unther R. Raidl and others},
  publisher	= {ACM Press},
  year		= {2009},
  pages         = {263--270},
keywords = {netdesign,bdmst},
  url = {https://www.ac.tuwien.ac.at/files/pub/gruber-09.pdf},
}