Computing Minimum Spanning Trees with Uncertainty

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Original language	English
Title of host publication	Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS)
Pages	277-288
Number of pages	12
DOIs	https://doi.org/10.48550/arXiv.0802.2855
Publication status	Published - 2008
Externally published	Yes

Access to Document

@inproceedings{28580e06b3e84f82a55f1caf0c1ad970,

title = "Computing Minimum Spanning Trees with Uncertainty",

author = "Michael Hoffmann and Thomas Erlebach and Danny Krizanc and Mat{\'u}{\v s} Mihal{\'a}k and Rajeev Raman",

year = "2008",

doi = "10.48550/arXiv.0802.2855",

language = "English",

pages = "277--288",

booktitle = "Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS)",

}

TY - GEN

T1 - Computing Minimum Spanning Trees with Uncertainty

AU - Hoffmann, Michael

AU - Erlebach, Thomas

AU - Krizanc, Danny

AU - Mihalák, Matúš

AU - Raman, Rajeev

PY - 2008

Y1 - 2008

U2 - 10.48550/arXiv.0802.2855

DO - 10.48550/arXiv.0802.2855

M3 - Conference article in proceeding

SP - 277

EP - 288

BT - Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS)

ER -