Name
Abstract | ||
|---|---|---|
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 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 base stations (points) such that within any range (for instance, rectangle), there is no interference. We show that any set of n points in ℝ2 can be conflict-free colored with $O(n^{\beta^{*}+o(1)})$ colors in expected polynomial time, where $\beta^{*}=\frac{3-\sqrt{5}}{2} |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00454-012-9425-5 | ACM Symposium on Parallel Algorithms and Architectures |
Keywords | DocType | Volume |
expected polynomial time,conflict-free coloring,points p,nonempty axis-parallel rectangle,n point,base station,rectangle range,frequency assignment,p w,recent interest | Journal | 48 |
Issue | ISSN | Citations |
1 | 0179-5376 | 19 |
PageRank | References | Authors |
1.23 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepak Ajwani | 1 | 188 | 22.30 |
| khaled elbassioni | 2 | 473 | 35.78 |
| Sathish Govindarajan | 3 | 110 | 12.84 |
| Saurabh Ray | 4 | 228 | 24.28 |