- Author:
- Panagiotis Cheilaris,
- Advisers:
- Stathis Zachos,
- Amotz Bar-Noy
Graph and hypergraph colorings constitute an important subject in combinatorics and algorithm theory. In this work, we study conflict-free coloring for hypergraphs. Conflict-free coloring is one possible generalization of traditional graph coloring. Conflict-free coloring hypergraphs induced by geometric shapes, like intervals on the line, or disks on the plane, has applications in frequency assignment in cellular networks. Colors model frequencies and since the frequency spectrum is limited and expensive, the goal of an algorithm is to minimize the number of assigned frequencies, that is, reuse frequencies as much as possible.
We concentrate on an online variation of the problem, especially in the case where the hypergraph is induced by intervals. For deterministic algorithms, we introduce a hierarchy of models ranging from static to online and we compute lower and upper bounds on the numbers of colors used.
In the randomized oblivious adversary model, we introduce a framework for conflict-free coloring a specific class of hypergraphs with a logarithmic number of colors. This specific class includes many hypergraphs arising in geometry and gives online randomized algorithm that use fewer colors and fewer random bits than other algorithms in the literature. Based on the same framework, we initiate the study of online deterministic algorithms that recolor few points.
For the problem of conlict-free coloring points with respect to a given set of intervals, we describe an efficient algorithm that computes a coloring with at most twice the number of colors of an optimal coloring. We also show that there is a family of inputs that force our algorithm to use two times the number of colors of an optimal solution.
Then, we study conflict-free coloring problems in graphs. We compare conflict-free coloring with respect to paths of graphs to a closely related problem, called vertex ranking, or ordered coloring. For conflict-free coloring with respect to neighborhoods of vertices of graphs, we prove that number of colors in the order of the square root of the number of vertices is sufficient and sometimes necessary.
Finally, we initiate the study of Ramsey-type problems for conflict-free colorings and compute a van der Waerden-like number.
Cited By
- Keller C and Smorodinsky S Conflict-free coloring of intersection graphs of geometric objects Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (2397-2411)
Bärtschi A, Ghosh S, Mihalák M, Tschager T and Widmayer P Improved bounds for the conflict-free chromatic art gallery problem Proceedings of the thirtieth annual symposium on Computational geometry, (144-153)- Cheilaris P, Keszegh B and Pálvölgyi D Unique-maximum and conflict-free coloring for hypergraphs and tree graphs Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science, (190-201)
- Cheilaris P, Smorodinsky S and Sulovský M The potential to improve the choice Proceedings of the twenty-seventh annual symposium on Computational geometry, (424-432)
Recommendations
Conflict-Free Coloring of Graphs
A conflict-free $k$-coloring of a graph assigns one of $k$ different colors to some of the vertices such that, for every vertex $v$, there is a color that is assigned to exactly one vertex among $v$ and $v$'s neighbors. Such colorings have applications in ...
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
AbstractProper conflict-free coloring is an intermediate notion between proper coloring of a graph and proper coloring of its square. It is a proper coloring such that for every non-isolated vertex, there exists a color appearing exactly once in its (...
Conflict-Free Coloring of String Graphs
AbstractConflict-free coloring (in short, CF-coloring) of a graph is a coloring of V such that the punctured neighborhood of each vertex contains a vertex whose color differs from the color of any other vertex in that neighborhood. Bounds on CF-...