Sciweavers

227 search results - page 1 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
ICALP
2003
Springer
15 years 3 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
14 years 12 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
111
Voted
SIAMCOMP
2012
13 years 16 days ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
80
Voted
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 17 days ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
82
Voted
JACM
2006
92views more  JACM 2006»
14 years 10 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie