Conflict-free coloring of points on a line with respect to a set of intervals

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

Conflict-free coloring of points on a line with respect to a set of intervals

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

Department of Computer Science

Research output: Contribution to conference › Paper › peer-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 language	English
Pages	93-96
Number of pages	4
State	Published - 1 Dec 2007
Event	19th Annual Canadian Conference on Computational Geometry, CCCG 2007 - Ottawa, ON, Canada Duration: 20 Aug 2007 → 22 Aug 2007

Conference

Conference	19th Annual Canadian Conference on Computational Geometry, CCCG 2007
Country/Territory	Canada
City	Ottawa, ON
Period	20/08/07 → 22/08/07

ASJC Scopus subject areas

Geometry and Topology

Cite this

@conference{ef514cd6444b44668cd8106e2d2ea280,

title = "Conflict-free coloring of points on a line with respect to a set of intervals",

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).",

author = "Katz, {Matthew J.} and Nissan Lev-Tov and Gila Morgenstern",

year = "2007",

month = dec,

day = "1",

language = "English",

pages = "93--96",

note = "19th Annual Canadian Conference on Computational Geometry, CCCG 2007 ; Conference date: 20-08-2007 Through 22-08-2007",

}

TY - CONF

T1 - Conflict-free coloring of points on a line with respect to a set of intervals

AU - Katz, Matthew J.

AU - Lev-Tov, Nissan

AU - Morgenstern, Gila

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=50849098351&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:50849098351

SP - 93

EP - 96

T2 - 19th Annual Canadian Conference on Computational Geometry, CCCG 2007

Y2 - 20 August 2007 through 22 August 2007

ER -

Conflict-free coloring of points on a line with respect to a set of intervals

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this