scientific article; zbMATH DE number 7204466

DOI10.4230/LIPICS.ICALP.2017.14MaRDI QIDQ5111343zbMATH OpenFDO

Authors Christian Coester, Elias Koutsoupias, Philip Lazos

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2017.14

zbMATH Keywords

\(k\)-serveronline algorithmsresource augmentation

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• The 3-server problem in the plane.
• New Ressults on Server Problems
• Competitive algorithms for server problems
• A competitive 2-server algorithm

Cited in

(9)

• Trackless online algorithms for the server problem
• Online in-time service problem with minimal server assignment
• Reallocating multiple facilities on the line
• A \(k\)-server problem with parallel requests and unit distances
• Stochastic analysis of the k-server problem on the circle
• The (h,k)-server problem on bounded depth trees
• The Infinite Server Problem
• Fundamentals of Computation Theory
• Server problems and resistive spaces

This page was built for publication:

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