Competitive Analysis via Regularization

DOI10.1137/1.9781611973402.32zbMath1420.68238OpenAlexW4243320487MaRDI QIDQ5383991

Joseph (Seffi) Naor, Shahar Chen, Niv Buchbinder

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.32

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (8)

Multistage knapsack ⋮ Multistage online maxmin allocation of indivisible entities ⋮ Nested convex bodies are chaseable ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Online multistage subset maximization problems ⋮ Unnamed Item ⋮ LP-based algorithms for multistage minimization problems

This page was built for publication: Competitive Analysis via Regularization