On convex body chasing

DOI10.1007/BF02189324zbMath0774.52008OpenAlexW1966160207MaRDI QIDQ1207798

Joel Friedman, Nathan Linial

Publication date: 16 May 1993

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131249

zbMATH Keywords

computational geometrychaseable families of convex sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Lipschitz selectors may not yield competitive algorithms for convex body chasing, Nested convex bodies are chaseable, Parametrized Metrical Task Systems, Online chasing problems for regular polygons, Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing, Better Bounds for Online Line Chasing, Algorithms for energy conservation in heterogeneous data centers, Algorithms for energy conservation in heterogeneous data centers, Competitive Algorithms for Layered Graph Traversal

Cites Work

• On the power of randomization in on-line algorithms
• Competitive \(k\)-server algorithms
• Random walks on weighted graphs and applications to on-line algorithms
• Competitive Algorithms for Layered Graph Traversal
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item