Approximating the minimum maximal independence number (Q685520)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 417418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minimum maximal independence number |
scientific article; zbMATH DE number 417418 |
Statements
Approximating the minimum maximal independence number (English)
0 references
9 January 1994
0 references
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.
0 references
approximation algorithms
0 references
unweighted \(NP\)-complete graph problem
0 references
0.8805041909217834
0 references
0.8433025479316711
0 references
0.8346424698829651
0 references
0.8339537382125854
0 references
0.8121469616889954
0 references
