Online minimum spanning trees with weight predictions

DOI10.1007/978-3-031-38906-1_10arXiv2302.12029MaRDI QIDQ6179406

Lene Monrad Favrholdt, Magnus Berg, Joan. Boyar, Kim S. Larsen

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

online algorithmspredictionsminimum spanning treerandom order analysis

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• A comparison of performance measures for online algorithms
• Online computation with advice
• Competitive snoopy caching
• The advice complexity of a class of hard online problems
• Information Complexity of Online Problems
• Random-Order Models
• Algorithms with Predictions
• Competitive Caching with Machine Learned Advice
• Measuring the problem-relevant information in input
• Online Minimum Spanning Tree with Advice
• Relative Worst-Order Analysis: A Survey

This page was built for publication: Online minimum spanning trees with weight predictions