Free access
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

Nested Convex Bodies are Chaseable


In the Convex Body Chasing problem, we are given an initial point v0 ∊ ℝd and an online sequence of n convex bodies F1, …, Fn. When we receive Fi, we are required to move inside Fi. Our goal is to minimize the total distance traveled. This fundamental online problem was first studied by Friedman and Linial (DCG 1993). They proved an lower bound on the competitive ratio, and conjectured that a competitive ratio depending only on d is possible. However, despite much interest in the problem, the conjecture remains wide open.
We consider the setting in which the convex bodies are nested: Fi ⊃ … ⊃ Fn. The nested setting is closely related to extending the online LP framework of Buchbinder and Naor (ESA 2005) to arbitrary linear constraints. Moreover, this setting retains much of the difficulty of the general setting and captures an essential obstacle in resolving Friedman and Linial's conjecture. In this work, we give a f(d)-competitive algorithm for chasing nested convex bodies in ℝd.

Formats available

You can view the full content in the following formats:

Information & Authors


Published In

cover image Proceedings
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages: 1253 - 1260
Editor: Artur Czumaj, University of Warwick, United Kingdom
ISBN (Online): 978-1-61197-503-1


Published online: 2 January 2018




This work was supported by NWO grant 639.022.211, ERC consolidator grant 617951, and GAČR grant P202/12/G061.

Metrics & Citations



If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options


View PDF

Get Access







Copy the content Link

Share with email

Email a colleague

Share on social media