Weakening the Online Adversary Just Enough to get Optimal Conflict-free Colorings for Intervals

A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Original languageEnglish
Title of host publicationProceedings Of The Nineteenth Annual Symposium On Parallelism In Algorithms And Architectures
Number of pages2
StatePublished - 2007


  • Online algorithms
  • Cellular networks
  • Coloring
  • Conflict free
  • Frequency assignment

Cite this