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.
Zitier-Link kopieren
Document-Link
https://www.db-thueringen.de/receive/dbt_mods_00019013
Nutzung und Vervielfältigung: Alle Rechte vorbehalten