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 conferencePaperpeer-review

3 Scopus citations

Abstract

We present a 2-approximation algorithm for CF-coloring of points on a line with respect to a given set of intervals. The running time of the algorithm is O(nlog n).

Original languageEnglish
Pages93-96
Number of pages4
StatePublished - 1 Dec 2007
Event19th Annual Canadian Conference on Computational Geometry, CCCG 2007 - Ottawa, ON, Canada
Duration: 20 Aug 200722 Aug 2007

Conference

Conference19th Annual Canadian Conference on Computational Geometry, CCCG 2007
Country/TerritoryCanada
CityOttawa, ON
Period20/08/0722/08/07

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