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

Authors:
Matthew J. Katz;Nissan Lev-Tov;Gila Morgenstern
Affiliations:
Department of Computer Science, Ben-Gurion University, Israel;Department of Computer Science, Ben-Gurion University, Israel;Department of Computer Science, Ben-Gurion University, Israel
Venue:
Computational Geometry: Theory and Applications
Year:
2012

Citing 6
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
Dynamic Algorithms in Computational Geometry

Dynamic Algorithms in Computational Geometry
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

SIAM Journal on Computing
Conflict-Free Coloring of Points and Simple Regions in the Plane

Discrete & Computational Geometry
Conflict-free coloring for intervals: from offline to online

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Online Conflict-Free Coloring for Intervals

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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