Conflict-free coloring made stronger

Elad Horev, Roi Krakovski, Shakhar Smorodinsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Scopus citations

Abstract

In FOCS 2002, Even et al. showed that any set of n discs in the plane can be Conflict-Free colored with a total of at most O(logn) colors. That is, it can be colored with O(logn) colors such that for any (covered) point p there is some disc whose color is distinct from all other colors of discs containing p. They also showed that this bound is asymptotically tight. In this paper we prove the following stronger results: (i) Any set of n discs in the plane can be colored with a total of at most O(k logn) colors such that (a) for any point p that is covered by at least k discs, there are at least k distinct discs each of which is colored by a color distinct from all other discs containing p and (b) for any point p covered by at most k discs, all discs covering p are colored distinctively. We call such a coloring a k-Strong Conflict-Free coloring. We extend this result to pseudo-discs and arbitrary regions with linear union-complexity. (ii) More generally, for families of n simple closed Jordan regions with union-complexity bounded by O(n1+α), we prove that there exists a k-Strong Conflict-Free coloring with at most O(kn α) colors. (iii) We prove that any set of n axis-parallel rectangles can be k-Strong Conflict-Free colored with at most O(k log 2 n) colors. (iv) We provide a general framework for k-Strong Conflict-Free coloring arbitrary hypergraphs. This framework relates the notion of k-Strong Conflict-Free coloring and the recently studied notion of k-colorful coloring. All of our proofs are constructive. That is, there exist polynomial time algorithms for computing such colorings.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings
Pages105-117
Number of pages13
DOIs
StatePublished - 21 Jul 2010
Event12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010 - Bergen, Norway
Duration: 21 Jun 201023 Jun 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6139 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010
Country/TerritoryNorway
CityBergen
Period21/06/1023/06/10

Keywords

  • Conflict-Free Colorings
  • Discrete geometry
  • Geometric hypergraphs
  • Wireless networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Conflict-free coloring made stronger'. Together they form a unique fingerprint.

Cite this