A k-server problem with parallel requests and unit distances
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.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten