Competitive analysis via regularization

DOI10.1137/1.9781611973402.32MaRDI QIDQ5383991zbMATH OpenOpenAlexFDO

Authors Niv Buchbinder, Shahar Chen, Joseph (Seffi) Naor

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

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

Recommendations

• The online set cover problem
• The online set cover problem
• Competitive analysis for multi-objective online algorithms
• Online primal-dual algorithms for covering and packing
• Beyond Competitive Analysis

Cited in

(14)

• Nested convex bodies are chaseable
• Online multistage subset maximization problems
• LP-based algorithms for multistage minimization problems
• Multistage knapsack
• Multistage online maxmin allocation of indivisible entities
• Unified algorithms for online learning and competitive analysis
• Beyond Competitive Analysis
• scientific article; zbMATH DE number 7525448 (Why is no real title available?)
• Multistage knapsack
• scientific article; zbMATH DE number 7238962 (Why is no real title available?)
• Distributional online weighted paging with limited horizon
• Online metric allocation and time-varying regularization
• Competitive data-structure dynamization
• Competitively chasing convex bodies

This page was built for publication: Competitive analysis via regularization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383991)