@article {
author = {Abam, M.A. and Rezaei Seraji, M.J. and Shadravan, M.},
title = {Online conflict-free coloring of intervals},
journal = {Scientia Iranica},
volume = {21},
number = {6},
pages = {2138-2141},
year = {2014},
publisher = {Sharif University of Technology},
issn = {1026-3098},
eissn = {2345-3605},
doi = {},
abstract = {In this paper, we study the problem of online conflict-free coloring of intervals on a line, where each newly inserted interval must be assigned a color upon insertion such that the coloring remains conflict-free, i.e. for each point p in the union of the current intervals, there must be an interval I with a unique color among all intervals covering p. We first present a simple algorithm which uses O(pn) colors where n is the number of current intervals. Next, we propose an CF-coloring of intervals which uses O(log3 n) colors},
keywords = {Frequency assignment,Conflict-free coloring,Intervals,On-line algorithms,Computational geometry},
url = {http://scientiairanica.sharif.edu/article_3607.html},
eprint = {http://scientiairanica.sharif.edu/article_3607_437db4a9645b9db91954fd85067f04d2.pdf}
}