scientific article; zbMATH DE number 7758362

DOI10.4230/lipics.approx/random.2020.60arXiv2005.13716MaRDI QIDQ6058190

Alexander Wei

Publication date: 31 October 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

beyond worst-case analysisonline cachinglearning-augmented algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (5)

Learning-augmented algorithms for online subset sum ⋮ Online Predictions for Online TSP on the Line ⋮ Online Metric Algorithms with Untrusted Predictions ⋮ Online interval scheduling with predictions ⋮ Machine learning advised algorithms for the ski rental problem with a discount

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line learning and the metrical task system problem
• Competitive analysis of randomized paging algorithms
• Randomized Competitive Algorithms for Generalized Caching
• Online Optimization with Uncertain Information
• Competitive paging algorithms
• Beyond Competitive Analysis
• Near-Optimal Bounds for Online Caching with Machine Learned Advice
• Interleaved Caching with Access Graphs
• Online Scheduling via Learned Weights
• A Primal-Dual Randomized Algorithm for Weighted Paging
• Scheduling with Predictions and the Price of Misprediction

This page was built for publication: