A k-server problem with parallel requests and unit distances

Hildenbrandt, Regina GND

In the paper a k-server problem with parallel requests where several servers can also be located on one point is considered. We show that a HARMONIC_p k-server algorithm is competitive against an adaptive online adversary in case of unit distances.

Cite

Citation style:

Hildenbrandt, Regina: A k-server problem with parallel requests and unit distances. 2011.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:
All rights reserved

Export