Computing Minimum Spanning Trees with Uncertainty

Michael Hoffmann 0002, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman. Computing Minimum Spanning Trees with Uncertainty. In Susanne Albers, Pascal Weil, editors, STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings. Volume 08001 of Dagstuhl Seminar Proceedings, pages 277-288, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008. [doi]

Authors

Michael Hoffmann 0002

This author has not been identified. Look up 'Michael Hoffmann 0002' in Google

Thomas Erlebach

This author has not been identified. Look up 'Thomas Erlebach' in Google

Danny Krizanc

This author has not been identified. Look up 'Danny Krizanc' in Google

Matús Mihalák

This author has not been identified. Look up 'Matús Mihalák' in Google

Rajeev Raman

This author has not been identified. Look up 'Rajeev Raman' in Google