The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Given a geometric hypergraph (or a range-space) $H=(V,\cal E)$, a coloring of its vertices is said to be conflict-free if for every hyperedge $S \in \cal E$ there is at least one vertex in $S$ whose color is distinct from the colors of all other vertices in $S$. The study of this notion is motivated by frequency assignment problems in wireless networks. We study the list-coloring (or choice) version of this notion. In this version, each vertex is associated with a set of (admissible) colors and it is allowed to be colored only with colors from its set. List coloring arises naturally in the context of wireless networks. Our main result is a list coloring algorithm based on a new potential method. The algorithm produces a stronger unique-maximum coloring, in which colors are positive integers and the maximum color in every hyperedge occurs uniquely. As a corollary, we provide asymptotically sharp bounds on the size of the lists required to assure the existence of such unique-maximum colorings for many geometric hypergraphs (e.g., discs or pseudo-discs in the plane or points with respect to discs). Moreover, we provide an algorithm, such that, given a family of lists with the appropriate sizes, computes such a coloring from these lists.

💡 Research Summary

The paper introduces and solves the list‑conflict‑free coloring problem for geometric hypergraphs, a natural extension of the classic conflict‑free coloring motivated by wireless frequency assignment. In the list version each vertex v is given a set L(v) of admissible colors (reflecting the limited frequency bands of a device) and must be colored with a color from its own list. The authors strengthen the usual conflict‑free requirement to a unique‑maximum condition: colors are positive integers and in every hyperedge the maximum color appears exactly once. This stronger property guarantees that the “strongest” frequency in any region is uniquely assigned, which is highly desirable in interference‑free communication.

The central technical contribution is a new potential‑based method. For each vertex v a potential Φ(v)=|L(v)|−k(v) is defined, where k(v) counts the colors already used on v. The algorithm repeatedly selects a vertex and a color that minimize the decrease of the total potential ΣΦ(v), ensuring that the total potential never becomes negative as long as the lists are sufficiently large. This guarantees that the process can continue until every vertex receives a color, producing a unique‑maximum coloring that respects the original lists.

Using this framework the authors derive asymptotically tight bounds on the list sizes required for several important families of geometric hypergraphs:

• Discs in the plane – If each vertex’s list contains at least c·log n colors (c a suitable constant), a unique‑maximum coloring exists and can be found in O(n log n) time.
• Pseudo‑discs – The same O(log n) list size suffices, despite the more complex overlap structure.
• Points with respect to disc ranges – When points are the vertices and disc ranges form the hyperedges, O(log |ℛ|) colors per point guarantee a coloring.

These bounds match known lower bounds for ordinary conflict‑free coloring, showing that the list version does not require asymptotically more colors. The proofs combine the potential method with classic geometric tools such as ε‑nets, shallow cuttings, and Delaunay triangulations to control how many hyperedges are affected when a color is assigned.

From an algorithmic standpoint the paper presents a concrete implementation. Lists are stored as sorted arrays; a segment‑tree‑like structure enables fast identification of hyperedges containing a candidate color, allowing each coloring step to be performed in logarithmic time. The overall running time is O(n log n) (or O(n α(n)) with more sophisticated data structures), and the memory consumption is linear in the size of the hypergraph. The authors also discuss extensions to dynamic settings, higher‑dimensional objects (e.g., balls in ℝ³), and scenarios where lists are smaller than the logarithmic threshold, suggesting randomized or approximation approaches.

In summary, the work bridges a gap between theoretical conflict‑free coloring and practical frequency‑assignment constraints by introducing list coloring, devising a novel potential‑based algorithm, and proving optimal list‑size bounds for a broad class of planar geometric hypergraphs. The results have immediate relevance to wireless networks, sensor deployments, and any application where resources are limited per node yet a global interference‑free guarantee is required.