Abstract
This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special instance types, including cactus graphs, for which we provide randomized algorithms. We introduce the problem of finding a minimum weight spanning star under uncertainty for which we show that no algorithm can achieve constant competitive ratio.
| Originalsprache | englisch |
|---|---|
| Seiten (von - bis) | 587-604 |
| Seitenumfang | 18 |
| Fachzeitschrift | Networks |
| Jahrgang | 83 |
| Ausgabenummer | 3 |
| Frühes Online-Datum | 11 Jan. 2024 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - Apr. 2024 |
ASJC Scopus subject areas
- Diskrete Mathematik und Kombinatorik
- Theoretische Informatik
- Information systems
- Computernetzwerke und -kommunikation
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Basic - Fundamental (Grundlagenforschung)