Online Metric Algorithms with Untrusted Predictions
From MaRDI portal
Publication:6075754
DOI10.1145/3582689arXiv2003.02144OpenAlexW3035590076MaRDI QIDQ6075754
No author found.
Publication date: 23 October 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.02144
Related Items (2)
Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm ⋮ Learning-augmented algorithms for online subset sum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online computation with advice
- The weighted majority algorithm
- Competitive \(k\)-server algorithms
- On-line algorithms for weighted bipartite matching and stable marriages
- A decision-theoretic generalization of on-line learning and an application to boosting
- On-line learning and the metrical task system problem
- The advice complexity of a class of hard online problems
- Online matching on a line
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- Competitively pricing parking in a tree
- Online Optimization with Uncertain Information
- Competitive algorithms for server problems
- Competitive paging algorithms
- Competitive Algorithms for Layered Graph Traversal
- Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
- An optimal on-line algorithm for metrical task system
- Online Weighted Matching
- Near-Optimal Bounds for Online Caching with Machine Learned Advice
- Online Scheduling via Learned Weights
- The online 𝑘-taxi problem
- Metrical task systems on trees via mirror descent and unfair gluing
- A Primal-Dual Randomized Algorithm for Weighted Paging
- Scheduling with Predictions and the Price of Misprediction
- Parametrized Metrical Task Systems
This page was built for publication: Online Metric Algorithms with Untrusted Predictions
