|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Weighted k-Server Bounds via Combinatorial Dichotomies | | Nikhil Bansal
; Marek Elias
; Grigorios Koumoutsos
; | | Date: |
11 Apr 2017 | | Abstract: | The weighted k-server problem is a natural generalization of the k-server
problem where each server has a different weight. We consider the problem on
uniform metrics, which corresponds to a natural generalization of paging. Our
main result is a doubly exponential lower bound on the competitive ratio of any
deterministic online algorithm, that essentially matches the known upper bounds
for the problem and closes a large and long-standing gap.
The lower bound is based on relating the weighted k-server problem to a
certain combinatorial problem and proving a Ramsey-theoretic lower bound for
it. This combinatorial connection also reveals several structural properties of
low cost feasible solutions to serve a sequence of requests. We use this to
show that the generalized Work Function Algorithm achieves an almost optimum
competitive ratio, and to obtain new refined upper bounds on the competitive
ratio for the case of d different weight classes. | | Source: | arXiv, 1704.3318 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER