We consider proper online colorings of hypergraphs defined by geometric regions. We prove that there is an online coloring method that colors N intervals of the real line using Θ(logN/k) colors such that for every point p, contained in at least k intervals, not all the intervals containing p have the same color. We also prove the corresponding result about online coloring quadrants in the plane that are parallel to a given fixed quadrant. These results contrast to recent results of the first and third author showing that in the quasi-online setting 12 colors are enough to color quadrants (independent of N and k). We also consider coloring intervals in the quasi-online setting. In all cases we present efficient coloring algorithms as well. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Keszegh, B., Lemons, N., & Pálvölgyi, D. (2013). Online and quasi-online colorings of wedges and intervals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7741 LNCS, pp. 292–306). https://doi.org/10.1007/978-3-642-35843-2_26
Mendeley helps you to discover research relevant for your work.