Conflict-free colorings of shallow discs

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 41-43

  Alon, Noga ^a,b   Smorodinsky, Shakhar ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Conflict free coloring; Frequency assignment; Wireless

Indexed keywords

COLOR; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; FREQUENCY ALLOCATION; PROBLEM SOLVING; RADIO;

CELLULAR NETWORKS; CONFLICT-FREE COLORINGS; FREQUENCY ASSIGNMENT;

COLOR COMPUTER GRAPHICS;

EID: 33748043312     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137864     Document Type: Conference Paper

References (14)

1. N. Alon and J. H. Spencer. The Probabilistic Method, 2nd edition. Wiley, 2000.
2. A. Bar-Noy, P. Hillaris and S. Smorodinsky. Conflict-Free coloring for intervals: from offline to online, submitted.
3. A. Bar-Noy, P. Hillaris and S. Smorodinsky. Randomized online conflict-free colorings for hypergraphs, manuscript 2006.
4. K. Chen, How to play a coloring game against a color-blind adversary, In Proc. 22nd Annual ACM Symposium on Computational Geometry (SoCG 2006).
5. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
6. K. Elbassioni and N. Mustafa, Conflict-Free colorings for rectangle ranges, In proc. the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006).
7. G. Even, Z. Lotker, D. Ron and S. Smorodinsky. Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks, SIAM J. Comput. 33(1):94-136 (2003).
8. A. Fiat, H. Kaplan, M. Levy, J. Matoušek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner and E. Welzl. Online conflict-free coloring for intervals. Proc. 16th Annual ACM-SIAM Symposium on Discrdete Algorithms (SODA 2005).
9. S. Har-Peled and S. Smorodinsky, Conflict-free coloring of points and simple regions in the plane, Discrete and Comput. Geom., 34:47-70 (2005).
10. H. Kaplan and M. Sharir, Online CF coloring for halfplanes, congruent disks, and axis-parallel rectangles, manuscript, 2004.
11. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59-71, 1986.
12. J. Pach and G. Tóth, Conflict free colorings. In Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Springer Verlag, Heidelberg, 2003.
13. S. Smorodinsky, Combinatorial Problems in Computational Geometry, Ph.D Dissertation, School of Computer Science, Tel-Aviv University, 2003.
14. S. Smorodinsky. On the chromatic number of some geometric hypergraphs. Proc. of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006).