Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty
Data Structures and Algorithms
2022-11-29 v1 Discrete Mathematics
Optimization and Control
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.
Cite
@article{arxiv.2211.15611,
title = {Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty},
author = {Corinna Mathwieser and Eranda Cela},
journal= {arXiv preprint arXiv:2211.15611},
year = {2022}
}