A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
From MaRDI portal
Publication:5351892
DOI10.4230/LIPIcs.APPROX-RANDOM.2015.96zbMath1375.68222OpenAlexW2261313794MaRDI QIDQ5351892
Nikhil Bansal, Kevin Schewior, Ravishankar Krishnaswamy, Anupam Gupta, Kirk R. Pruhs, Clifford Stein
Publication date: 31 August 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5297/pdf/7.pdf/
Convex programming (90C25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (7)
Nested convex bodies are chaseable ⋮ Unnamed Item ⋮ Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing ⋮ Online multistage subset maximization problems ⋮ Better Bounds for Online Line Chasing ⋮ Algorithms for energy conservation in heterogeneous data centers ⋮ Algorithms for energy conservation in heterogeneous data centers
This page was built for publication: A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
