Chasing Convex Bodies Optimally

DOI10.1137/1.9781611975994.92MaRDI QIDQ5146869zbMATH OpenOpenAlexFDO

Authors Mark Sellke

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.11968

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• On convex body chasing
• Chasing Nested Convex Bodies Nearly Optimally
• Competitively chasing convex bodies
• Chasing convex bodies with linear competitive ratio (invited paper)
• Chasing Convex Bodies with Linear Competitive Ratio
• Chasing Convex Bodies with Linear Competitive Ratio
• Chasing convex bodies and functions
• A Nearly-Linear Bound for Chasing Nested Convex Bodies
• Nested convex bodies are chaseable
• Nested convex bodies are chaseable

Cited in

(16)

• Chasing Convex Bodies with Linear Competitive Ratio
• Better Bounds for Online Line Chasing
• Chasing Nested Convex Bodies Nearly Optimally
• A Nearly-Linear Bound for Chasing Nested Convex Bodies
• Algorithms for energy conservation in heterogeneous data centers
• Algorithms for energy conservation in heterogeneous data centers
• Lipschitz selectors may not yield competitive algorithms for convex body chasing
• Online geometric covering and piercing
• Deterministic 3-server on a circle and the limitation of canonical potentials
• Online paging with heterogeneous cache slots
• The online min-sum set cover problem
• Low recourse arborescence forests under uniformly random arcs
• Online metric allocation and time-varying regularization
• Competitively chasing convex bodies
• Metrical service systems with transformations
• Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle

This page was built for publication: Chasing Convex Bodies Optimally

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146869)