Approximating the minimum maximal independence number (Q685520): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90022-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976422444 / rank | |||
Normal rank | |||
Revision as of 23:11, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the minimum maximal independence number |
scientific article |
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
