scientific article
From MaRDI portal
Publication:2921711
zbMath1297.68083MaRDI QIDQ2921711
János Pach, Elchanan Mossel, Meital Levy, Shakhar Smorodinsky, Amos Fiat, Ermo Welzl, Uli Wagner, Micha Sharir, Ji{ří} Matoušek
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors, Complexity of conflict-free colorings of graphs, Strong conflict-free coloring for intervals, Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points, Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
