The online house numbering problem: Min-max online list labeling

William E. Devanny; Jeremy T. Fineman; Michael T. Goodrich; Tsvi Kopelowitz

doi:10.4230/LIPIcs.ESA.2017.33

The online house numbering problem: Min-max online list labeling

William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	25th European Symposium on Algorithms, ESA 2017
Editors	Christian Sohler, Christian Sohler, Kirk Pruhs
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959770491
DOIs	https://doi.org/10.4230/LIPIcs.ESA.2017.33
State	Published - 1 Sep 2017
Externally published	Yes
Event	25th European Symposium on Algorithms, ESA 2017 - Vienna, Austria Duration: 4 Sep 2017 → 6 Sep 2017

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	87
ISSN (Print)	1868-8969

Conference

Conference	25th European Symposium on Algorithms, ESA 2017
Country/Territory	Austria
City	Vienna
Period	4/09/17 → 6/09/17

Bibliographical 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.

Funding

∗ 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.

Funders	Funder number
National Science Foundation	CCF-16375, 1228639, CCF-1514383, CCF-1617727, CCF-1526631
Defense Advanced Research Projects Agency

Keywords

File maintenance
House numbering
List labeling

Access to Document

10.4230/LIPIcs.ESA.2017.33

Cite this

Devanny, W. E., Fineman, J. T., Goodrich, M. T., & Kopelowitz, T. (2017). The online house numbering problem: Min-max online list labeling. In C. Sohler, C. Sohler, & K. Pruhs (Eds.), 25th European Symposium on Algorithms, ESA 2017 Article 33 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 87). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.33

Devanny, William E. ; Fineman, Jeremy T. ; Goodrich, Michael T. et al. / The online house numbering problem : Min-max online list labeling. 25th European Symposium on Algorithms, ESA 2017. editor / Christian Sohler ; Christian Sohler ; Kirk Pruhs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{5f9ce710c0454517b7178b3518d7fbf7,

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 Christian Sohler and Kirk Pruhs",

booktitle = "25th European Symposium on Algorithms, ESA 2017",

address = "גרמניה",

}

Devanny, WE, Fineman, JT, Goodrich, MT & Kopelowitz, T 2017, The online house numbering problem: Min-max online list labeling. in C Sohler, C Sohler & K Pruhs (eds), 25th European Symposium on Algorithms, ESA 2017., 33, Leibniz International Proceedings in Informatics, LIPIcs, vol. 87, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25th European Symposium on Algorithms, ESA 2017, Vienna, Austria, 4/09/17. https://doi.org/10.4230/LIPIcs.ESA.2017.33

The online house numbering problem: Min-max online list labeling. / Devanny, William E.; Fineman, Jeremy T.; Goodrich, Michael T. et al.
25th European Symposium on Algorithms, ESA 2017. ed. / Christian Sohler; Christian Sohler; Kirk Pruhs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 33 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 87).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The online house numbering problem

T2 - 25th European Symposium on Algorithms, ESA 2017

AU - Devanny, William E.

AU - Fineman, Jeremy T.

AU - Goodrich, Michael T.

AU - Kopelowitz, Tsvi

N1 - 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.

PY - 2017/9/1

Y1 - 2017/9/1

N2 - 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.

AB - 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.

KW - File maintenance

KW - House numbering

KW - List labeling

UR - http://www.scopus.com/inward/record.url?scp=85030543856&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ESA.2017.33

DO - 10.4230/LIPIcs.ESA.2017.33

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85030543856

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 25th European Symposium on Algorithms, ESA 2017

A2 - Sohler, Christian

A2 - Pruhs, Kirk

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

Y2 - 4 September 2017 through 6 September 2017

ER -

Devanny WE, Fineman JT, Goodrich MT, Kopelowitz T. The online house numbering problem: Min-max online list labeling. In Sohler C, Sohler C, Pruhs K, editors, 25th European Symposium on Algorithms, ESA 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 33. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ESA.2017.33

The online house numbering problem: Min-max online list labeling

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this