A New Approach to the Server Problem

DOI10.1137/0404029MaRDI QIDQ3977290zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Geometric two-server algorithms
• A competitive 2-server algorithm
• An application of various algorithms for solving the k-server problem
• The generalized two-server problem
• The 3-server problem in the plane.

Cited in

(10)

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

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

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