On Online Labeling with Polynomially Many Labels

DOI10.1007/978-3-642-33090-2_12zbMath1365.68475arXiv1210.3197OpenAlexW1916550914MaRDI QIDQ2912834

Michal Koucký, Vladimír Čunát, Jan Bulánek, Martin Babka, Michael E. Saks

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3197

zbMATH Keywords

lower boundsonline labelingfile maintenance problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Tight Lower Bounds for the Online Labeling Problem ⋮ On Online Labeling with Large Label Set

This page was built for publication: On Online Labeling with Polynomially Many Labels