Metrical service systems with transformations

DOI10.4230/LIPICS.ITCS.2021.21MaRDI QIDQ7229306zbMATH OpenFDO

Authors Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.21

zbMATH Keywords

\(k\)-taxicompetitive analysismetrical task systemsonline algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Nearly-Linear Bound for Chasing Nested Convex Bodies
• A tight bound on approximating arbitrary metrics by tree metrics
• An optimal on-line algorithm for metrical task system
• Chasing Convex Bodies Optimally
• Chasing Convex Bodies with Linear Competitive Ratio
• Chasing Nested Convex Bodies Nearly Optimally
• Competitively chasing convex bodies
• Extending partial isometries
• Globalization of the partial isometries of metric spaces and local approximation of the group of isometries of Urysohn space
• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Metrical task systems on trees via mirror descent and unfair gluing
• On metric Ramsey-type phenomena
• Ramsey-type theorems for metric spaces with applications to online problems
• The online k-taxi problem
• Two-point homogeneous spaces

Cited in

(1)

• Smoothed analysis of online metric problems

This page was built for publication: Metrical service systems with transformations

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