The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems (Q1356067)
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: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems |
scientific article |
Statements
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems (English)
0 references
4 June 1997
0 references
NP-complete problem
0 references
independent set
0 references
polynomial time \(\rho\)-approximation algorithm
0 references
vertex covering
0 references
quadratic programming as subproblem
0 references
