Approximating the minimum maximal independence number (Q685520): Difference between revisions

We consider the problem of approximating the size of a minimum non- extendible independent set of a graph, also known as the minimum dominating independence number. We strengthen a result of \textit{R. W. Irving} [Inf. Process. Lett. 37, No. 4, 197-200 (1991; Zbl 0713.68033)] to show that there is no constant \(\epsilon >0\) for which this problem can be approximated within a factor on \(n^{1-\epsilon}\) in polynomial time, unless \(P=NP\). This is the strongest lower bound we are aware of for polynomial-time approximation of an unweighted \(NP\)-complete graph problem.