Startseite > Publikationen > Publikationen

Publikationen

Bienkowski, Marcin;Kutylowski, Jaroslaw:

The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.

In: Proc. of the 10th International Workshop on Algorithms and Data Structures (WADS), LNCS, S. 337-348, 1. Jan. 2007, Springer-Verlag Berlin

Abstract

We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.
Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.

Bibtex

@inproceedings{hniid=2836,
author = {Bienkowski, Marcin and Kutylowski, Jaroslaw},
title = {The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces},
booktitle = {Proc. of the 10th International Workshop on Algorithms and Data Structures (WADS)},
series = {LNCS},
pages = {337-348},
publisher = {Springer-Verlag Berlin},
month = {1~} # jan,
year = {2007},
}

BibTeX in die Zwischenablage kopieren

Permalink

https://www.hni.uni-paderborn.de/pub/2836