Computing Minimum Spanning Trees with Uncertainty

Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matúš Mihalák, Rajeev Raman

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Original languageEnglish
Title of host publicationProceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS)
Pages277-288
Number of pages12
Publication statusPublished - 2008
Externally publishedYes

Cite this

Hoffmann, M., Erlebach, T., Krizanc, D., Mihalák, M., & Raman, R. (2008). Computing Minimum Spanning Trees with Uncertainty. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 277-288) http://arxiv.org/abs/0802.2855