Fundamentals of Computation Theory

DOI10.1007/11537311MaRDI QIDQ5492935zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, J. Noga, Wolfgang W. Bein, Kazuo Iwama

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11537311

zbMATH Keywords

Design and analysis of algorithmsapproximation and randomized algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Approximation algorithms (68W25)

Recommendations

• New Ressults on Server Problems
• The \(k\)-server problem
• Online service with delay
• Online service with delay
• scientific article; zbMATH DE number 7204466

Cited in

(2)

• The \(k\)-server problem
• Charlemagne's Challenge: The Periodic Latency Problem

This page was built for publication: Fundamentals of Computation Theory

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