A New Approach to the Server Problem

DOI10.1137/0404029zbMath0737.68041OpenAlexW2054831624MaRDI QIDQ3977290

Lawrence L. Larmore, Marek Chrobak

Publication date: 25 June 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e1f8971f599a6bd478651b05dd2f142f6a23e1ca

zbMATH Keywords

optimization problemsserver problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (10)

Competitive randomized algorithms for nonuniform problems ⋮ A better lower bound on the competitive ratio of the randomized 2-server problem ⋮ A lower bound for two-server balancing algorithms ⋮ The CNN problem and other \(k\)-server variants ⋮ Trees, tight-spans and point configurations ⋮ A note on the server problem and a benevolent adversary ⋮ A competitive 2-server algorithm ⋮ Geometric two-server algorithms ⋮ HARMONIC is 3-competitive for two servers ⋮ Injective subsets of \(l_{\infty}(I)\)

This page was built for publication: A New Approach to the Server Problem