Article

Conflict-free coloring for rectangle ranges using O(n^.382) colors

Authors:

Deepak Ajwani,

Khaled Elbassioni,

Sathish Govindarajan,

Saurabh RayAuthors Info & Claims

SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures

Pages 181 - 187

https://doi.org/10.1145/1248377.1248406

Published: 09 June 2007 Publication History

Get Access

Abstract

Given a set of points P ⊆ R², a conflict-free coloring of P w.r.t. rectangle ranges is an assignment of colors to points of P, such that each non-empty axis-parallel rectangle T in the plane contains a point whose color is distinct from all other points in P ∩ T. This notion has been the subject of recent interest, and is motivated by frequency assignment in wireless cellular networks: one naturally would like to minimize the number of frequencies (colors) assigned to bases stations (points), such that within any range (for instance, rectangle), there is no interference. We show that any set of n points in R² can be conflict-free colored with Õ(n^β+ε) colors in expected polynomial time, for any arbitrarily small ε > 0 and β = 3?√5<over>2 < 0.382. This improves upon the previously known bound of O(√nlog log n/ log n).

References

[1]

N. Alon, M. Krivelevich, and B. Sudakov. Coloring graphs with sparse neighborhoods. J. Combinatorial Theory Ser. B., 77:73--82, 1999.

Digital Library

Google Scholar

[2]

N. Alon and S. Smorodinsky. Conflict-free colorings of shallow discs. In SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry, pages 41--43, New York, NY, USA, 2006. ACM Press.

Digital Library

Google Scholar

[3]

A. Bar-Noy, P. Cheilaris, and S. Smorodinsky. Conflict-free coloring for intervals: from offline to online. In SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 128--137, New York, NY, USA, 2006. ACM Press.

Digital Library

Google Scholar

[4]

K. Chen. How to play a coloring game against a color-blind adversary. In SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry, pages 44--51, New York, NY, USA, 2006. ACM Press.

Digital Library

Google Scholar

[5]

K. Chen, H. Kaplan, and M. Sharir. Online cf coloring for halfplanes, congruent disks, and axis-parallel rectangles. Manuscript, 2006.

Google Scholar

[6]

X. Chen, J. Pach, M. Szegedy, and G. Tardos. Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Manuscript, 2007.

Google Scholar

[7]

K. Elbassioni and N. H. Mustafa. Conflict-free colorings of rectangles ranges. In STACS, pages 254--263, 2006.

Digital Library

Google Scholar

[8]

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:94--136, 2003.

Digital Library

Google Scholar

[9]

A. Fiat, M. Levy, J. Matou?sek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner, and E. Welzl. Online conflict-free coloring for intervals. In Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005.

Digital Library

Google Scholar

[10]

S. Har-Peled and S. Smorodinsky. Conflict-free coloring of points and simple regions in the plane. Discrete & Comput. Geom., 34:47--70, 2005.

Digital Library

Google Scholar

[11]

R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.

Digital Library

Google Scholar

[12]

J. Pach and G. Tóth. Conflict free colorings. In Discrete & Comput. Geom., The Goodman-Pollack Festschrift. Springer Verlag, Heidelberg, 2003.

Google Scholar

[13]

S. Smorodinsky. On the chromatic number of some geometric hypergraphs. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 316--323, New York, NY, USA, 2006. ACM Press.

Digital Library

Google Scholar

Cited By

View all

Singhal RSengar APrem Prakash VAgrawal M(2021)A Novel Heuristic for Estimating Two-Colorability for Conflict-Free Coloring in Simple GraphsAdvances in Systems Engineering10.1007/978-981-15-8025-3_33(327-335)Online publication date: 24-Jan-2021
https://doi.org/10.1007/978-981-15-8025-3_33
Abel ZAlvarez VDemaine EFekete SGour AHesterberg AKeldenich PScheffer CKlein P(2017)Three colors sufficeProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039813(1951-1963)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039813
Keszegh BLemons NPálvölgyi D(2013)Online and Quasi-online Colorings of Wedges and IntervalsSOFSEM 2013: Theory and Practice of Computer Science10.1007/978-3-642-35843-2_26(292-306)Online publication date: 2013
https://doi.org/10.1007/978-3-642-35843-2_26
Show More Cited By

Index Terms

Conflict-free coloring for rectangle ranges using O(n^.382) colors
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms

Recommendations

Conflict-Free Coloring for Rectangle Ranges Using O(n ^.382) Colors

Given a set of points P⊆ℝ², a conflict-free coloring of P w.r.t. rectangle ranges is an assignment of colors to points of P, such that each nonempty axis-parallel rectangle T in the plane contains a point whose color is distinct from all other points in ...
Conflict-Free Coloring for Rectangle Ranges Using O(n.382) Colors

Given a set of points P⊆ź2, a conflict-free coloring of P w.r.t. rectangle ranges is an assignment of colors to points of P, such that each nonempty axis-parallel rectangle T in the plane contains a point whose color is distinct from all other points in ...
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 ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures

June 2007

376 pages

ISBN:9781595936677

DOI:10.1145/1248377

General Chair:
Phillip B. Gibbons
Intel Research, USA
,
Program Chair:
Christian Scheideler
Technische Universität München, Germany

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA07

Sponsor:

SPAA07: 19th ACM Symposium on Parallelism in Algorithms and Architectures

June 9 - 11, 2007

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
256
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Singhal RSengar APrem Prakash VAgrawal M(2021)A Novel Heuristic for Estimating Two-Colorability for Conflict-Free Coloring in Simple GraphsAdvances in Systems Engineering10.1007/978-981-15-8025-3_33(327-335)Online publication date: 24-Jan-2021
https://doi.org/10.1007/978-981-15-8025-3_33
Abel ZAlvarez VDemaine EFekete SGour AHesterberg AKeldenich PScheffer CKlein P(2017)Three colors sufficeProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039813(1951-1963)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039813
Keszegh BLemons NPálvölgyi D(2013)Online and Quasi-online Colorings of Wedges and IntervalsSOFSEM 2013: Theory and Practice of Computer Science10.1007/978-3-642-35843-2_26(292-306)Online publication date: 2013
https://doi.org/10.1007/978-3-642-35843-2_26
Ajwani DElbassioni KGovindarajan SRay S(2012)Conflict-Free Coloring for Rectangle Ranges Using O(n.382) ColorsDiscrete & Computational Geometry10.5555/3116652.311692048:1(39-52)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.5555/3116652.3116920
Chan TDey TWhitesides S(2012)Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent setProceedings of the twenty-eighth annual symposium on Computational geometry10.1145/2261250.2261293(293-302)Online publication date: 17-Jun-2012
https://dl.acm.org/doi/10.1145/2261250.2261293
Keszegh B(2012)Coloring half-planes and bottomless rectanglesComputational Geometry: Theory and Applications10.1016/j.comgeo.2011.09.00445:9(495-507)Online publication date: 1-Nov-2012
https://dl.acm.org/doi/10.1016/j.comgeo.2011.09.004
Ajwani DElbassioni KGovindarajan SRay S(2012)Conflict-Free Coloring for Rectangle Ranges Using O(n .382) ColorsDiscrete & Computational Geometry10.1007/s00454-012-9425-548:1(39-52)Online publication date: 28-Apr-2012
https://doi.org/10.1007/s00454-012-9425-5
Pira E(2012)Unique-Minimum Conflict-Free Coloring for a Chain of RingsAdvances in Computer Science and Information Technology. Computer Science and Engineering10.1007/978-3-642-27308-7_35(319-324)Online publication date: 2012
https://doi.org/10.1007/978-3-642-27308-7_35
Cheilaris PSmorodinsky SSulovský MHurtado Fvan Kreveld M(2011)The potential to improve the choiceProceedings of the twenty-seventh annual symposium on Computational geometry10.1145/1998196.1998266(424-432)Online publication date: 13-Jun-2011
https://dl.acm.org/doi/10.1145/1998196.1998266
Pach JTardos G(2010)NotesJournal of Combinatorial Theory Series A10.1016/j.jcta.2009.04.007117:6(776-782)Online publication date: 1-Aug-2010
https://dl.acm.org/doi/10.1016/j.jcta.2009.04.007
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Conflict-Free Coloring for Rectangle Ranges Using O(n ^.382) Colors

Conflict-Free Coloring for Rectangle Ranges Using O(n.382) Colors

Online Conflict-Free Coloring for Intervals