Online multi-coloring on the path revisited
From MaRDI portal
Publication:378204
DOI10.1007/S00236-013-0184-4zbMath1286.68509OpenAlexW1985367371MaRDI QIDQ378204
Marie G. Christ, Kim S. Larsen, Lene Monrad Favrholdt
Publication date: 11 November 2013
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-013-0184-4
Network design and communication in computer systems (68M10) Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive snoopy caching
- 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
- Three Results on Frequency Assignment in Linear Cellular Networks
- Distributed Online Frequency Assignment in Cellular Networks
- 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs
- Frequency Allocation Problems for Linear Cellular Networks
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: Online multi-coloring on the path revisited