Canadian traveller problem with predictions

DOI10.1007/978-3-031-18367-6_6arXiv2209.11100MaRDI QIDQ6176553

Michalis Xefteris, Evripidis Bampis, Bruno Escoffier

Publication date: 25 July 2023

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

online algorithmCanadian traveller problemlearning augmented algorithm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest paths without a map
• A note on the \(k\)-Canadian traveller problem
• The Canadian Traveller Problem and its competitive analysis
• On the competitiveness of memoryless strategies for the \(k\)-Canadian traveller problem
• An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
• On the randomized online strategies for the \(k\)-Canadian traveler problem
• Approximating the Canadian traveller problem with online randomization
• The Canadian Traveller Problem Revisited
• Algorithms with Predictions
• Competitive Caching with Machine Learned Advice
• Near-Optimal Bounds for Online Caching with Machine Learned Advice
• Online Scheduling via Learned Weights
• The sample complexity of revenue maximization
• Scheduling with Predictions and the Price of Misprediction
• Flow time scheduling with uncertain processing time

This page was built for publication: Canadian traveller problem with predictions