by Martin Berlakovich, Mario Ruthmair, Günther R. Raidl
Reference:
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree ProblemMartin Berlakovich, Mario Ruthmair, Günther R. RaidlProceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 256–263, 2012, Springer.
Bibtex Entry:
@inproceedings{berlakovich-12,
author = {Martin Berlakovich and Mario Ruthmair and G{\"u}nther R. Raidl},
booktitle = {{Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I}},
keywords = {netdesign},
editor = {R. Moreno-D{\'i}az and F. Pichler and A. Quesada-Arencibia},
pages = {256--263},
url = {https://www.ac.tuwien.ac.at/files/pub/berlakovich-12.pdf},
publisher = {Springer},
series = {{LNCS}},
title = {A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem},
volume = {6927},
year = {2012}
}