Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2006.04.039 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2006.04.039 / rank | |||
Normal rank | |||
Latest revision as of 06:10, 10 December 2024
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
