A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set (Q4887135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set |
scientific article; zbMATH DE number 912364
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set |
scientific article; zbMATH DE number 912364 |
Statements
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set (English)
0 references
20 February 1997
0 references
NP-complete
0 references
independent set problem
0 references
constant-ratio-polynomial-time-approximation-algorithm
0 references
set covering
0 references
0.837846577167511
0 references
0.805243968963623
0 references
