Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

Raidl, G. R.; Julstrom, B. A.

by G. R. Raidl, B. A. Julstrom

Reference:

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree ProblemG. R. Raidl, B. A. JulstromProceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 747–752, 2003, ACM Press.

Bibtex Entry:

@INPROCEEDINGS{raidl-03,
author = {G. R. Raidl and B. A. Julstrom},
title = {Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem},
booktitle = {Proceedings of the 2003 ACM Symposium on Applied Computing},
editor = {G. Lamont and others},
publisher = {{ACM} Press},
year = 2003,
pages = {747--752},
url = {https://www.ac.tuwien.ac.at/files/pub/raidl-03.pdf},
keywords = {evolcomp,netdesign},
}