Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring

S. M. Dhannya; N. S. Narayanaswamy

Home/Archive/arXiv

arXiv · 1812.01459

Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring

S. M. Dhannya·N. S. Narayanaswamy

View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a hypergraph $H$, the conflict-free colouring problem is to colour vertices of $H$ using minimum colours so that each hyperedge in $H$ sees a unique colour. We present a polynomial time reduction from the conflict-free colouring problem in hypergraphs to the maximum independent set problem in a class of simple graphs, which we refer to as \textit{conflict graphs}. We also present another characterization of the conflict-free colouring number in terms of the chromatic number of graphs in an associated family of simple graphs, which we refer to as \textit{co-occurrence graphs}. We present perfectness results for co-occurrence graphs and a special case of conflict graphs. Based on these results and a linear program that returns an integer solution in polynomial time, we obtain a polynomial time algorithm to compute a minimum conflict-free colouring of interval hypergraphs, thus solving an open problem due to Cheilaris et al.\cite{CPLGARSS2014}. Finally, we use the co-occurrence graph characterization to prove that for an interval hypergraph, the conflict-free colouring number is the minimum partition of its intervals into sets such that each set has an exact hitting set (a hitting set in which each interval is hit exactly once).

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

S. M. Dhannya, N. S. Narayanaswamy. 2018-12-04. Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring. https://arxiv.org/abs/1812.01459

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗