Online learning for min-max discrete problems
From MaRDI portal
Publication:2166779
DOI10.1016/j.tcs.2022.07.024OpenAlexW2956358468MaRDI QIDQ2166779
Evripidis Bampis, Kim Thang Nguyen, Dimitris Christou, Bruno Escoffier
Publication date: 25 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.05944
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Min-Max Spanning Tree Problem and some extensions
- The weighted majority algorithm
- A decision-theoretic generalization of on-line learning and an application to boosting
- Learning in auctions: regret is hard, envy is easy
- Online linear optimization and adaptive routing
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Efficient algorithms for online decision problems
- Regret Minimization for Reserve Prices in Second-Price Auctions
- Playing Games with Approximation Algorithms
- Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
- Algorithms for two bottleneck optimization problems
- Algorithms for Scheduling Independent Tasks
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Oracle-efficient Online Learning and Auction Design
- On non-optimally expanding sets in Grassmann graphs
- The computational power of optimization in online learning
- Near-Optimal Algorithms for Online Matrix Prediction
This page was built for publication: Online learning for min-max discrete problems
