On Randomized Online Labeling with Polynomially Many Labels

DOI10.1007/978-3-642-39206-1_25zbMath1336.68284OpenAlexW80879492MaRDI QIDQ5326569

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

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_25

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) 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 Randomized Online Labeling with Polynomially Many Labels