An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem (bibtex)
by
Reference:
An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree ProblemBoris KopinitschJan 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl and M. Gruber
Bibtex Entry:
@MASTERSTHESIS{kopinitsch_06,
author = {Boris Kopinitsch},
title = {An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem},
school = {Vienna University of Technology, Institute of Computer
Graphics and Algorithms},
address = {Vienna, Austria},
month = Jan,
year = {2006},
url = {https://www.ac.tuwien.ac.at/files/pub/kopinitsch_06.pdf},
note = {supervised by G.~Raidl and M.~Gruber},
keywords = {evolcomp,netdesign},
}