Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty-Reference-Cited by-同舟云学术

Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty

Published:2024-01-11 Issue:3 Volume:83 Page:587-604
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Mathwieser Corinna¹^ORCID,Çela Eranda²^ORCID

Affiliation:

1. Lehr‐ und Forschungsgebiet Kombinatorische Optimierung RWTH Aachen University Aachen Germany

2. Department of Discrete Mathematics TU Graz Graz Austria

Abstract

AbstractThis 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.

Publisher

Wiley

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.22204

Reference16 articles.

1. E.Bampis C.Dürr T. W.Erlebach M. S.deLima N.Megow andJ.Schloter.Orienting (hyper)graphs under explorable stochastic uncertainty. Paper presented at: 29th annual European symposium on algorithms (ESA 2021).202110:1–10:18.

2. Query minimization under stochastic uncertainty

3. C.Dürr T.Erlebach N.Megow andJ.Meißner.Scheduling with Explorable uncertainty 9th innovations in theoretical computer science conference Vol. 94 of Leibniz international proceedings in informatics (LIPIcs) Schloss Dagstuhl–Leibniz‐Zentrum fuer Informatik.201830:1–30:14.

4. T.Erlebach M. S.deLima N.Megow andJ.Schloter.Learning‐augmented query policies for minimum spanning tree with uncertainty. Paper presented at: 30th annual European symposium on algorithms (ESA 2022).202249:1–49:18.