1. Home

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.

Preview

Category

In Series:
Preprint / Technische Universität Ilmenau, Institut für Mathematik
Vol. 11-16 (30.09.2011)
Date Created:
30.09.2011
Date Issued:
30.09.2011
PPN:
776924559
Language:
English
Type of Resource:
Text
Keywords:
k-server problem; parallel requests; unit distances; Harmonic algorithm; adaptive online adversary; stochastic dynamic distance optimal partitioning (SDDP) problem
Classification:
Klasse A
Classification:
für Harvesting bereitgestellt
DDC subject of DNB:
510 Mathematics
Hosting institution:
Technische Universität Ilmenau, Fakultät für Mathematik und Naturwissenschaften

Cite

Citation style:
Could not load citation form.

Rights

Use and reproduction:
All rights reserved

Export

BibTeX, MODS, MARCXML, RIS, ISI, PICA, CSV, DC