Abstract
We prove an optimal lower bound on the complexity of randomized algorithms for the online labeling problem with polynomially many labels. All previous work on this problem (both upper and lower bounds) only applied to deterministic algorithms, so this is the first paper addressing the (im)possibility of faster randomized algorithms. Our lower bound Ω(n log(n)) matches the complexity of a known deterministic algorithm for this setting of parameters so it is asymptotically optimal.
In the online labeling problem with parameters n and m we are presented with a sequence of n items from a totally ordered universe U and must assign each arriving item a label from the label set {1,2,…,m} so that the order of labels (strictly) respects the ordering on U. As new items 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.
Full version of the paper is available from the second author’s homepage.
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.
References
Afek, Y., Awerbuch, B., Plotkin, S., Saks, M.: Local management of a global resource in a communication network. J. ACM 43(1), 1–19 (1996)
Babka, M., Bulánek, J., Čunát, V., Koucký, M., Saks, M.: On Online Labeling with Polynomially Many Labels. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 121–132. Springer, Heidelberg (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., Demaine, E., Farach-Colton, M.: Cache-oblivious B-trees. SIAM J. Comput. 35(2), 341–358 (2005)
Bender, M., Duan, Z., Iacono, J., Wu, J.: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2), 115–136 (2004)
Bird, R., Sadnicki, S.: Minimal on-line labelling. Inf. Process. Lett. 101(1), 41–45 (2007)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)
Brodal, G., Fagerberg, R., Jacob, R.: Cache oblivious search trees via binary trees of small height. In: SODA, pp. 39–48 (2002)
Bulánek, J., Koucký, M., Saks, M.: Tight lower bounds for online labeling problem. In: STOC, pp. 1185–1198 (2012)
Dietz, P., Seiferas, J., Zhang, J.: A tight lower bound for online monotonic list labeling. SIAM J. Discrete Math. 18(3), 626–637 (2004)
Dietz, P., Zhang, J.: Lower bounds for monotonic list labeling. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol. 447, pp. 173–180. Springer, Heidelberg (1990)
Emek, Y., Korman, A.: New bounds for the controller problem. Distributed Computing 24(3-4), 177–186 (2011)
Itai, A., Konheim, A., 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)
Korman, A., Kutten, S.: Controller and estimator for dynamic networks. In: PODC, pp. 175–184 (2007)
Willard, D.: A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Inf. Comput. 97(2), 150–204 (1992)
Zhang, J.: Density Control and On-Line Labeling Problems. PhD thesis, University of Rochester (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bulánek, J., Koucký, M., Saks, M. (2013). On Randomized Online Labeling with Polynomially Many Labels. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-39206-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39205-4
Online ISBN: 978-3-642-39206-1
eBook Packages: Computer ScienceComputer Science (R0)