Tight lower bounds for the online labeling problem

DOI10.1145/2213977.2214083zbMath1286.68101OpenAlexW2031770154MaRDI QIDQ5415544

Jan Bulánek, Michal Koucký, Michael E. Saks

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2213977.2214083

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) Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

On Online Labeling with Large Label Set

This page was built for publication: Tight lower bounds for the online labeling problem