Lipschitz selectors may not yield competitive algorithms for convex body chasing

DOI10.1007/s00454-023-00491-3arXiv2104.07487OpenAlexW4383225739MaRDI QIDQ6050222

C. J. Argue, Anupam Gupta, Marco Molinaro

Publication date: 12 October 2023

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

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

zbMATH Keywords

online algorithmsHausdorff distanceLipschitzselectorconvex body chasing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computer science (68-XX)

Cites Work

• Unnamed Item
• Continuity properties of selectors and Michael's theorem
• Online chasing problems for regular polygons
• The Steiner point in infinite dimensions
• \(L_p\) metrics for compact convex sets
• On convex body chasing
• Polygonal approximation of plane convex bodies
• Lipschitz selections of set-valued mappings and Helly's theorem
• Barycentric selectors and a Steiner-type point of a convex body in a Banach space
• Lipschitz retracts, selectors, and extensions
• Nested convex bodies are chaseable
• Chasing Convex Bodies and Functions
• Distributions of Angles in Random Packing on Spheres
• Chasing Nested Convex Bodies Nearly Optimally
• Chasing Convex Bodies Optimally
• Chasing Convex Bodies with Linear Competitive Ratio
• Competitively chasing convex bodies
• A Nearly-Linear Bound for Chasing Nested Convex Bodies
• Convex Bodies The Brunn-MinkowskiTheory
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem

This page was built for publication: Lipschitz selectors may not yield competitive algorithms for convex body chasing