scientific article; zbMATH DE number 1559591

zbMath0968.68191MaRDI QIDQ4527040

Carl Burch, Andrew Tomkins, Avrim L. Blum, Yair Bartal

Publication date: 1 March 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

metrical task system

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items

New results for online page replication ⋮ The weighted 2-server problem ⋮ Uniform metrical task systems with a limited number of states ⋮ On multi-threaded metrical task systems ⋮ The \(k\)-server problem ⋮ Spanners in sparse graphs ⋮ Parametrized Metrical Task Systems ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ Ramsey-type theorems for metric spaces with applications to online problems ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Local embeddings of metric spaces ⋮ A Combinatorial Metrical Task System Problem Under the Uniform Metric ⋮ A randomized on–line algorithm for the k–server problem on a line ⋮ Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing ⋮ A randomized algorithm for two servers on the line. ⋮ A general decomposition theorem for the \(k\)-server problem