Efficient Online Linear Optimization with Approximation Algorithms

DOI10.1287/moor.2020.1053OpenAlexW3092656196MaRDI QIDQ4991673

Dan Garber

Publication date: 3 June 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

online algorithmsonline learningapproximation algorithmsregret minimizationonline linear optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Efficient algorithms for online decision problems
• Combinatorial Online Prediction via Metarounding
• Playing Games with Approximation Algorithms
• Adaptive routing with end-to-end feedback
• A Greedy Heuristic for the Set-Covering Problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Computing correlated equilibria in multi-player games

This page was built for publication: Efficient Online Linear Optimization with Approximation Algorithms