Loading...

Online conflict-free coloring of intervals

Abam, M. A ; Sharif University of Technology

517 Viewed
  1. Type of Document: Article
  2. Abstract:
  3. 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(√n) colors where n is the number of current intervals. Next, we propose an CF-coloring of intervals which uses O(log3 n) colors
  4. Keywords:
  5. Color ; Computational geometry ; Social networking (online) ; Conflict free ; Conflict-Free Colorings ; Frequency assignments ; Intervals ; On-line algorithms ; Online conflict-free coloring ; SIMPLE algorithm ; Coloring
  6. Source: Scientia Iranica ; Vol. 21, issue. 6 , 2014 , p. 2138-2141
  7. URL: http://scientiairanica.com/en/ManuscriptDetail?mid=1867