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

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

doi:10.1016/j.comgeo.2012.01.013

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 journal › Article › peer-review

13 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 language	English
Pages (from-to)	508-514
Number of pages	7
Journal	Computational Geometry: Theory and Applications
Volume	45
Issue number	9
DOIs	https://doi.org/10.1016/j.comgeo.2012.01.013
State	Published - 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

Access to Document

10.1016/j.comgeo.2012.01.013

Cite this

@article{484399c35f254260aa0431e9dd31ee9a,

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

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

keywords = "Approximation algorithms, Conflict-free coloring, Frequency assignment",

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

year = "2012",

month = nov,

day = "1",

doi = "10.1016/j.comgeo.2012.01.013",

language = "English",

volume = "45",

pages = "508--514",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier B.V.",

number = "9",

}

TY - JOUR

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 - 2012/11/1

Y1 - 2012/11/1

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

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

KW - Approximation algorithms

KW - Conflict-free coloring

KW - Frequency assignment

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

U2 - 10.1016/j.comgeo.2012.01.013

DO - 10.1016/j.comgeo.2012.01.013

M3 - Article

AN - SCOPUS:84861800759

SN - 0925-7721

VL - 45

SP - 508

EP - 514

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

IS - 9

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this