On online labeling with polynomially many labels

0382019 - MÚ 2013 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Babka, M. - Bulánek, Jan - Čunát, V. - Koucký, Michal - Saks, M.
On online labeling with polynomially many labels.
Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Berlin: Springer, 2012 - (Epstein, L.; Ferragina, P.), s. 121-132. Lecture Notes in Computer Science, 7501. ISBN 978-3-642-33089-6.
[20th Annual European Symposium on Algorithms (ESA 2012). Ljubljana (SI), 10.09.2012-12.09.2012]
Grant CEP: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institucionální podpora: RVO:67985840
Klíčová slova: online labeling * file maintenance problem * lower bounds
Kód oboru RIV: BA - Obecná matematika
http://link.springer.com/chapter/10.1007/978-3-642-33090-2_12

In the online labeling problem with parameters n and m we are presented with a sequence of n keys from a totally ordered universe U and must assign each arriving key a label from the label set {1,2,…,m} so that the order of labels (strictly) respects the ordering on U. As new keys arrive it may be necessary to change the labels of some items; such changes may be done at any time at unit cost for each change. The goal is to minimize the total cost. An alternative formulation of this problem is the file maintenance problem, in which the items, instead of being labeled, are maintained in sorted order in an array of length m, and we pay unit cost for moving an item.
Trvalý link: http://hdl.handle.net/11104/0215656