Amotz Bar-Noy
Abstract
We investigate deterministic algorithms for a frequency assignment problem in cellular networks. The problem can be modeled as a special vertex coloring problem for hypergraphs: In every hyperedge there must exist a vertex with a color that occurs exactly once in the hyperedge (the conflict-free property). We concentrate on a special case of the problem, called conflict-free coloring for intervals. We introduce a hierarchy of four models for the aforesaid problem: (i) static, (ii) dynamic offline, (iii) dynamic online with absolute positions, and (iv) dynamic online with relative positions. In the dynamic offline model, we give a deterministic algorithm that uses at most log3/2 n + 1 ≈ 1.71 log2 n colors and show inputs that force any algorithm to use at least 3 log5 n + 1 ≈ 1.29 log2 n colors. For the online absolute-positions model, we give a deterministic algorithm that uses at most 3⌈log3 n⌉ ≈ 1.89 log2 n colors. To the best of our knowledge, this is the first deterministic online algorithm using O(log n) colors in a nontrivial online model. In the online relative-positions model, we resolve an open problem by showing a tight analysis on the number of colors used by the first-fit greedy online algorithm. We also consider conflict-free coloring only with respect to intervals that contain at least one of the two extreme points.
- Ajwani, D., Elbassioni, K., Govindarajan, S., and Ray, S. 2007. Conflict-Free coloring for rectangle ranges using O(n.382) colors. In Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 181--187. Google Scholar
Digital Library
- Alon, N., and Smorodinsky, S. 2006. Conflict-Free colorings of shallow discs. In Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SoCG), 41--43. Google ScholarDigital Library
- Bar-Noy, A., Cheilaris, P., Olonetsky, S., and Smorodinsky, S. 2007. Online conflict-free coloring for geometric hypergraphs. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP), 219--230. Google ScholarDigital Library
- Bar-Noy, A., Cheilaris, P., and Smorodinsky, S. 2006. Conflict-Free coloring for intervals: From offline to online. In Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 128--137. Google ScholarDigital Library
- Borodin, A., and El-Yaniv, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press, New York. Google ScholarDigital Library
- Chen, K. 2006. How to play a coloring game against a color-blind adversary. In Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SoCG), 44--51. Google ScholarDigital Library
- Chen, K., Fiat, A., Kaplan, H., Levy, M., Matoušek, J., Mossel, E., Pach, J., Sharir, M., Smorodinsky, S., Wagner, U., and Welzl, E. 2007. Online conflict-free coloring for intervals. SIAM J. Comput. 36, 5, 1342--1359. Google ScholarDigital Library
- Chen, K., Kaplan, H., and Sharir, M. 2006. Online conflict free coloring for halfplanes, congruent disks, and axis-parallel rectangles. Manuscript.Google Scholar
- Elbassioni, K. , and Mustafa, N. H. 2006. Conflict-Free colorings of rectangles ranges. In Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS), 254--263. Google ScholarDigital Library
- Even, G., Lotker, Z., Ron, D., and Smorodinsky, S. 2003. Conflict-Free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM J. Comput. 33, 94--136. Google ScholarDigital Library
- Fiat, A., Levy, M., Matoušek, J., Mossel, E., Pach, J., Sharir, M., Smorodinsky, S., Wagner, U., and Welzl, E. 2005. Online conflict-free coloring for intervals. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 545--554. Google ScholarDigital Library
- Har-Peled, S., and Smorodinsky, S. 2005. Conflict-Free coloring of points and simple regions in the plane. Discr. Comput. Geom. 34, 47--70. Google ScholarDigital Library
- Iyer, A. V., Ratliff, H. R., and Vijayan, G. 1988. Optimal node ranking of trees. Inf. Process. Lett. 28, 225--229. Google ScholarDigital Library
- Katchalski, M., McCuaig, W., and Seager, S. 1995. Ordered colourings. Discr. Math. 142, 141--154. Google ScholarDigital Library
- Katz, M. J., Lev-Tov, N., and Morgenstern, G. 2007. Conflict-Free coloring of points on a line with respect to a set of intervals. In Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 93--96.Google Scholar
- Pach, J. , and Tóth, G. 2003. Conflict free colorings. In Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Springer, 665--671.Google Scholar
- Smorodinsky, S. 2003. Combinatorial problems in computational geometry. Ph.D. thesis, School of Computer Science, Tel-Aviv University.Google Scholar
- Smorodinsky, S. 2007. On the chromatic number of some geometric hypergraphs. SIAM J. Discr. Math. 21, 3, 676--687. Google ScholarDigital Library
Index Terms
- Deterministic conflict-free coloring for intervals: From offline to online
Recommendations
Conflict-free coloring for intervals: from offline to online
SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architecturesThis paper studies deterministic algorithms for a frequency assignment problem in cellular networks. A cellular network consists of fixed-position base stations and moving agents. Each base station operates at a fixed frequency, and this allows an agent ...
Online Conflict-Free Coloring for Intervals
We consider an online version of the conflict-free coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflict-free, in the sense that in every ...
Distributed (δ+1)-coloring in linear (in δ) time
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computingThe distributed (Δ + 1)-coloring problem is one of most fundamental and well-studied problems in Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there was a long line of gradually improving algorithms published. The current ...
Comments