A Randomized Algorithm for Two Servers in Cross Polytope Spaces

DOI10.1007/978-3-540-77918-6_20zbMath1130.68341OpenAlexW2180461869MaRDI QIDQ5443387

James A. Oravec, Jun Kawahara, Lawrence L. Larmore, Wolfgang W. Bein, Kazuo Iwama

Publication date: 20 February 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_20

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Randomized competitive analysis for two server problems ⋮ Randomized Competitive Analysis for Two-Server Problems ⋮ Knowledge state algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A better lower bound on the competitive ratio of the randomized 2-server problem
• Competitive analysis of randomized paging algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• Equitable Revisited
• On the k -server conjecture

This page was built for publication: A Randomized Algorithm for Two Servers in Cross Polytope Spaces