Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty

Corinna Marlene Mathwieser, Eranda Cela

Research output: Working paperPreprint

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
Original languageEnglish
Number of pages21
Publication statusPublished - 28 Nov 2022

Keywords

  • cs.DS
  • cs.DM
  • math.OC

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Fingerprint

Dive into the research topics of 'Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty'. Together they form a unique fingerprint.

Cite this