Weakening the online adversary just enough to get optimal conflict-free colorings for intervals

Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky. Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. In Phillip B. Gibbons, Christian Scheideler, editors, SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007. pages 194-195, ACM, 2007. [doi]

Abstract

Abstract is missing.