On the Additive Constant of the k-Server Work Function Algorithm

DOI10.1007/978-3-642-12450-1_12zbMath1284.68679OpenAlexW1849268530MaRDI QIDQ3558920

Amos Korman, Pierre Fraigniaud, Adi Rosén, Yuval Emek

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_12

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (2)

The \(k\)-server problem with advice in \(d\) dimensions and on the sphere ⋮ Online computation with advice

Cites Work

• Competitive algorithms for server problems
• Online Computation with Advice
• On the k -server conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Additive Constant of the k-Server Work Function Algorithm