Randomized competitive analysis for two server problems
From MaRDI portal
Publication:1662430
DOI10.3390/A1010030zbMATH Open1445.68339OpenAlexW1967323656MaRDI QIDQ1662430FDOQ1662430
Authors: Kazuo Iwama, Jun Kawahara, Wolfgang W. Bein 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a1010030
Recommendations
- Randomized Competitive Analysis for Two-Server Problems
- scientific article; zbMATH DE number 2038743
- A better lower bound on the competitive ratio of the randomized 2-server problem
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- A randomized algorithm for two servers in cross polytope spaces
- scientific article; zbMATH DE number 1256655
- A competitive 2-server algorithm
- Competitive \(k\)-server algorithms
- Competitive algorithms for server problems
- Randomized algorithm for the \(k\)-server problem on decomposable spaces
Cites Work
- On the online bin packing problem
- Gadgets, Approximation, and Linear Programming
- Randomized competitive algorithms for the list update problem
- Random walks on weighted graphs and applications to on-line algorithms
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Competitive randomized algorithms for nonuniform problems
- A better lower bound on the competitive ratio of the randomized 2-server problem
- Title not available (Why is that?)
- An Optimal On-Line Algorithm for K Servers on Trees
- Competitive algorithms for server problems
- Competitive paging algorithms
- On the k -server conjecture
- A randomized algorithm for two servers on the line.
- New Ressults on Server Problems
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Title not available (Why is that?)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- Equitable Revisited
- Dynamic TCP acknowledgement and other stories about e/(e-1)
- Title not available (Why is that?)
Cited In (16)
- Title not available (Why is that?)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- R-LINE: a better randomized 2-server algorithm on the line
- A better lower bound on the competitive ratio of the randomized 2-server problem
- Breaking the 2-competitiveness barrier for two servers in a tree
- Randomized Competitive Analysis for Two-Server Problems
- Title not available (Why is that?)
- R-LINE: a better randomized 2-server algorithm on the line
- Competitive randomized algorithms for nonuniform problems
- Server problems and resistive spaces
- Multiple spin-block decisions
- Randomized algorithms for online bounded bidding
- A competitive 2-server algorithm
- The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
- A randomized algorithm for two servers on the line.
- A randomized algorithm for two servers in cross polytope spaces
This page was built for publication: Randomized competitive analysis for two server problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662430)
