Randomized Competitive Analysis for Two-Server Problems

DOI10.1007/978-3-540-87744-8_14zbMath1158.68545OpenAlexW1967323656MaRDI QIDQ3541083

Jun Kawahara, Wolfgang W. Bein, Kazuo Iwama

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a1010030

Mathematics Subject Classification ID

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

Related Items (1)

A comparison of performance measures for online algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A better lower bound on the competitive ratio of the randomized 2-server problem
• Every planar map is four colorable. I: Discharging
• Randomized competitive algorithms for the list update problem
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• On the online bin packing problem
• Competitive algorithms for server problems
• Equitable Revisited
• Competitive paging algorithms
• On the k -server conjecture
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Gadgets, Approximation, and Linear Programming
• Dynamic TCP acknowledgement and other stories about e/(e-1)
• A Randomized Algorithm for Two Servers in Cross Polytope Spaces
• Finite-State Online Algorithms and Their Automated Competitive Analysis

This page was built for publication: Randomized Competitive Analysis for Two-Server Problems