Strong conflict-free coloring for intervals

Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky

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

1 Scopus citations


We consider the k-strong conflict-free (k-SCF) coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring is conflict-free in the following sense: in every interval I of the family there are at least k colors each appearing exactly once in I. We first present a polynomial time algorithm for the general problem; the algorithm has approximation ratio 2 when k = 1 and 5 - 2/k when k > 1 (our analysis is tight). In the special case of a family that contains all possible intervals on the given set of points, we show that a 2-approximation algorithm exists, for any k ≥ 1. We also show that the problem of deciding whether a given family of intervals can be 1-SCF colored with at most q colors has a quasipolynomial time algorithm.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783642352607
StatePublished - 1 Jan 2012
Event23rd International Symposium on Algorithms and Computation, ISAAC 2012 - Taipei, Taiwan, Province of China
Duration: 19 Dec 201221 Dec 2012

Publication series

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


Conference23rd International Symposium on Algorithms and Computation, ISAAC 2012
Country/TerritoryTaiwan, Province of China

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Strong conflict-free coloring for intervals'. Together they form a unique fingerprint.

Cite this