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

DOI10.1002/net.22204arXiv2211.15611WikidataQ130202040 ScholiaQ130202040MaRDI QIDQ6196899

Eranda Çela, Unnamed Author

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.15611

zbMATH Keywords

competitive analysisonline algorithmsspanning treerandomized algorithmscactus graphsexplorable uncertainty

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The robust knapsack problem with queries
• Spanning spiders and light-splitting switches
• Minimum Spanning Tree Verification Under Uncertainty
• Computing shortest paths with uncertainty
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• Query minimization under stochastic uncertainty

This page was built for publication: Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty