Conflict-Free Coloring of points on a line with respect to a set of intervals

Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

We present approximation algorithms for CF-coloring of points on a line with respect to a given set of intervals. For the restricted case where no two intervals have a common right endpoint, we present a 2-approximation algorithm, and, for the general case where intervals may share a right endpoint, we present a 4-approximation algorithm. The running time of both algorithms is O(nlogn).

Original languageEnglish
Pages (from-to)508-514
Number of pages7
JournalComputational Geometry: Theory and Applications
Volume45
Issue number9
DOIs
StatePublished - 1 Nov 2012

Keywords

  • Approximation algorithms
  • Conflict-free coloring
  • Frequency assignment

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Conflict-Free Coloring of points on a line with respect to a set of intervals'. Together they form a unique fingerprint.

Cite this