A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem (bibtex)
by ,
Reference:
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree ProblemMario Ruthmair, Günther R. RaidlExtended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 244–246, 2009.
Bibtex Entry:
@INPROCEEDINGS{ruthmair-08,
author = {Mario Ruthmair and Günther R. Raidl},
title = {A {K}ruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem},
year = {2009},
booktitle = {Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)},
address = {Gran Canaria, Spain},
editor = {A. Quesada-Arencibia and others},
pages = {244--246},
keywords = {netdesign,grasp,vnd},
url = {https://www.ac.tuwien.ac.at/files/pub/ruthmair-08.pdf},
}
Powered by bibtexbrowser