Logarithmic price of buffer downscaling on line metrics

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10385245" target="_blank" >RIV/00216208:11320/18:10385245 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.tcs.2017.10.008" target="_blank" >https://doi.org/10.1016/j.tcs.2017.10.008</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2017.10.008" target="_blank" >10.1016/j.tcs.2017.10.008</a>

Result language
angličtina
Original language name
Logarithmic price of buffer downscaling on line metrics
Original language description
We consider the reordering buffer problem on a line consisting of n equidistant points. We show that, for any constant delta, an (offline) algorithm that has a buffer (1- delta) . k performs worse by a factor of Omega(logn) than an offline algorithm with buffer k. In particular, this demonstrates that the O(logn)-competitive online algorithm MOVINGPARTITION by Gamzu and Segev (2009) [9] is essentially optimal against any offline algorithm with a slightly larger buffer.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)