Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles

Ke Chen*, Haim Kaplan, Micha Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We present randomized algorithms for online conflict-free coloring (CF in short) of points in the plane, with respect to halfplanes, congruent disks, and nearly-equal axis-parallel rectangles. In all three cases, the coloring algorithms use O(log n) colors, with high probability. We also present a deterministic algorithm for online CF coloring of points in the plane with respect to nearly-equal axis-parallel rectangles, using O(log 3n) colors. This is the first efficient (i.e, using polylog(n) colors) deterministic online CF coloring algorithm for this problem.

Original languageEnglish
Article number16
JournalACM Transactions on Algorithms
Volume5
Issue number2
DOIs
StatePublished - 1 Mar 2009

Keywords

  • Coloring
  • Conflict free coloring
  • Online algorithms

Fingerprint

Dive into the research topics of 'Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles'. Together they form a unique fingerprint.

Cite this