Chasing Nested Convex Bodies Nearly Optimally - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Sébastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke. Chasing Nested Convex Bodies Nearly Optimally. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 1496-1508, SIAM, 2020. [doi]

The following publications are possibly variants of this publication:

A Nearly-Linear Bound for Chasing Nested Convex BodiesC. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee. soda 2019: 117-122 [doi]

Chasing Convex Bodies OptimallyMark Sellke. soda 2020: 1509-1518 [doi]

Competitively chasing convex bodiesSébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke. stoc 2019: 861-868 [doi]

Competitively Chasing Convex BodiesSébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke. SICOMP, 52(1):67-81, February 2023. [doi]

runs on WebDSL