Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859)
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: Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover |
scientific article |
Statements
Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (English)
0 references
19 February 2007
0 references
approximation hardness
0 references
2SAT-deletion
0 references
vertex cover
0 references
\(k\)-approximation algorithm
0 references
