Dynamic Offline Conflict-Free Coloring for Unit Disks
From MaRDI portal
Publication:3602844
DOI10.1007/978-3-540-93980-1_19zbMath1209.68357OpenAlexW1499896405MaRDI QIDQ3602844
Joseph Wun-Tat Chan, Xiangyu Hong, Hing-Fung Ting, Francis Y. L. Chin
Publication date: 12 February 2009
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_19
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Efficient bounds for the stable set, vertex cover and set packing problems
- Conflict-free coloring of points and simple regions in the plane
- On the chromatic number of some geometric hypergraphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Deterministic conflict-free coloring for intervals
- Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
- Online Conflict‐Free Coloring for Intervals
- Online Conflict-Free Colorings for Hypergraphs
- Conflict-Free Colorings of Rectangles Ranges
This page was built for publication: Dynamic Offline Conflict-Free Coloring for Unit Disks