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, R., 2011. A k-server problem with parallel requests and unit distances.
Could not load citation form. Default citation form is displayed.

Rights

Use and reproduction:
All rights reserved

Export