@inproceedings{b7a90a96b6dc4804b95aea4495a5eede,
title = "The online house numbering problem: Min-max online list labeling",
abstract = "We introduce and study the online house numbering problem, where houses are added arbitrarily along a road and must be assigned labels to maintain their ordering along the road. The online house numbering problem is related to classic online list labeling problems, except that the optimization goal here is to minimize the maximum number of times that any house is relabeled. We provide several algorithms that achieve interesting tradeoffs between upper bounds on the number of maximum relabels per element and the number of bits used by labels.",
keywords = "File maintenance, House numbering, List labeling",
author = "Devanny, \{William E.\} and Fineman, \{Jeremy T.\} and Goodrich, \{Michael T.\} and Tsvi Kopelowitz",
note = "Funding Information: ∗ This research was supported in part by NSF grants CCF-1617727, 1228639, CCF-1526631, CCF-1514383 and CCF-16375, and by the Canada Research Chair for Algorithm Design. This article is also supported in part by DARPA under agreement no. AFRL FA8750-15-2-0092. The views expressed are those of the authors and do not reflect the official policy or position of the Department of Defense or the U.S. Government. 1 Unless another base is indicated, all logarithms in this paper are base 2.; 25th European Symposium on Algorithms, ESA 2017 ; Conference date: 04-09-2017 Through 06-09-2017",
year = "2017",
month = sep,
day = "1",
doi = "10.4230/LIPIcs.ESA.2017.33",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Christian Sohler and Kirk Pruhs",
booktitle = "25th European Symposium on Algorithms, ESA 2017",
address = "ألمانيا",
}