Abstract
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.
For the case m = cn for constant c > 1, there are known algorithms that use at most O(n log(n)2) relabelings in total [9], and it was shown recently that this is asymptotically optimal [1]. For the case of m = θ(n C) for C > 1, algorithms are known that use O(n logn) relabelings. A matching lower bound was claimed in [7]. That proof involved two distinct steps: a lower bound for a problem they call prefix bucketing and a reduction from prefix bucketing to online labeling. The reduction seems to be incorrect, leaving a (seemingly significant) gap in the proof. In this paper we close the gap by presenting a correct reduction to prefix bucketing. Furthermore we give a simplified and improved analysis of the prefix bucketing lower bound. This improvement allows us to extend the lower bounds for online labeling to the case where the number m of labels is superpolynomial in n. In particular, for superpolynomial m we get an asymptotically optimal lower bound Ω((n logn) / (loglogm − loglogn)).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bulánek, J., Koucký, M., Saks, M.: Tight lower bounds for the online labeling problem. In: Karloff, H.J., Pitassi, T. (eds.) Proc. of 66th Symp. of Theory of Computation (STOC 2012), pp. 1185–1198. ACM (2012)
Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two Simplified Algorithms for Maintaining Order in a List. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 152–164. Springer, Heidelberg (2002)
Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious b-trees. Journal on Computing 35(2), 341–358 (2005)
Bender, M.A., Duan, Z., Iacono, J., Wu, J.: A locality-preserving cache-oblivious dynamic dictionary. Journal of Algorithms 53(2), 115–136 (2004)
Brodal, G.S., Fagerberg, R., Jacob, R.: Cache oblivious search trees via binary trees of small height. In: Eppstein, D. (ed.) Proc. of 13th ACM-SIAM Symp. on Discrete Algorithms. SODA, pp. 39–48. ACM/SIAM (2002)
Bird, R.S., Sadnicki, S.: Minimal on-line labelling. Information Processing Letters 101(1), 41–45 (2007)
Dietz, P.F., Seiferas, J.I., Zhang, J.: A tight lower bound for online monotonic list labeling. SIAM J. Discrete Mathematics 18(3), 626–637 (2004)
Emek, Y., Korman, A.: New bounds for the controller problem. Distributed Computing 24(3-4), 177–186 (2011)
Itai, A., Konheim, A.G., Rodeh, M.: A Sparse Table Implementation of Priority Queues. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 417–431. Springer, Heidelberg (1981)
Willard, D.E.: A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation 97(2), 150–204 (1992)
Zhang, J.: Density Control and On-Line Labeling Problems. PhD thesis, University of Rochester (1993)
Babka, M., Bulánek, J., Čunát, V., Koucký, M., Saks, M.: On Online Labeling with Superlinearly Many Labels (2012) (manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babka, M., Bulánek, J., Čunát, V., Koucký, M., Saks, M. (2012). On Online Labeling with Polynomially Many Labels. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)