Chasing Convex Bodies with Linear Competitive Ratio

DOI10.1137/1.9781611975994.93OpenAlexW3001363793MaRDI QIDQ5146870

C. J. Argue, Guru Prashanth Guruganesh, Anupam Gupta, Ziye Tang

Publication date: 2 February 2021

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Lipschitz selectors may not yield competitive algorithms for convex body chasing ⋮ Nested convex bodies are chaseable ⋮ Algorithms for energy conservation in heterogeneous data centers ⋮ Algorithms for energy conservation in heterogeneous data centers

This page was built for publication: Chasing Convex Bodies with Linear Competitive Ratio