A Nearly-Linear Bound for Chasing Nested Convex Bodies

DOI10.1137/1.9781611975482.8zbMath1431.68115arXiv1806.08865OpenAlexW2949558446MaRDI QIDQ5236189

Yin Tat Lee, Anupam Gupta, Michael B. Cohen, C. J. Argue, Sébastien Bubeck

Publication date: 15 October 2019

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Lipschitz selectors may not yield competitive algorithms for convex body chasing ⋮ Unnamed Item ⋮ Nested convex bodies are chaseable ⋮ Better Bounds for Online Line Chasing

This page was built for publication: A Nearly-Linear Bound for Chasing Nested Convex Bodies