Loading...

Tight online conflict-free coloring of intervals

Abam, M. A ; Sharif University of Technology | 2021

169 Viewed
  1. Type of Document: Article
  2. DOI: 10.24200/SCI.2020.54600.3826
  3. Publisher: Sharif University of Technology , 2021
  4. Abstract:
  5. This study revisited the problem of online con ict-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. The bestknown algorithm uses O(log3 n) colors, where n is the number of current intervals. A simple greedy algorithm was presented that used only O(log n) colors. Therefore, the open problem raised in [Abam, M.A., Rezaei Seraji, M.J., and Shadravan, M. "Online conflictfree coloring of intervals", Journal of Scientia Iranica, 21(6), pp. 2138{2141 (2014).] was resolved. © 2021 Sharif University of Technology. All rights reserved
  6. Keywords:
  7. Engineering ; Natural sciences ; Best-known algorithms ; Conflict free ; Greedy algorithms ; Online conflict-free coloring ; Color ; Algorithm ; Color ; Internet
  8. Source: Scientia Iranica ; Volume 28, Issue 3 D , 2021 , Pages 1493-1496 ; 10263098 (ISSN)
  9. URL: http://scientiairanica.sharif.edu/article_22068.html