Approximating maximum independent set in \(k\)-clique-free graphs (Q4400853)
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 1182770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating maximum independent set in \(k\)-clique-free graphs |
scientific article; zbMATH DE number 1182770 |
Statements
25 October 1998
0 references
independent set
0 references
clique
0 references
independence number
0 references
0.8083086609840393
0 references
0.8060038685798645
0 references
0.8045250773429871
0 references
Approximating maximum independent set in \(k\)-clique-free graphs (English)
0 references
The paper gives new lower bounds and approximation algorithms for the independence number of a graph. In particular, the lower bound of Ajtai, Erdős, Komlós and Szemerédi and the algorithm of Halldórsson and Radhakrishnan are improved. For the entire collection see [Zbl 0892.00051].
0 references