A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Berlakovich, Martin; Ruthmair, Mario; Raidl, Günther R.

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. RaidlExtended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 247–249, 2011.

Bibtex Entry:

@InProceedings{berlakovich-11,
author = {Martin Berlakovich and Mario Ruthmair and G{\"u}nther R. Raidl},
title = {A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem},
booktitle = {Extended Abstracts of EUROCAST 2011 -- 13th International Conference on Computer Aided Systems Theory},
address = {Las Palmas de Gran Canaria, Spain},
editor = {Alexis Quesada-Arencibia and others},
year = {2011},
pages = {247--249},
keywords = {netdesign,hybrid},
url = {https://www.ac.tuwien.ac.at/files/pub/berlakovich-11.pdf},
}