Solving min ones 2-SAT as fast as vertex cover (Q393120)
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: Solving min ones 2-SAT as fast as vertex cover |
scientific article; zbMATH DE number 6246039
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving min ones 2-SAT as fast as vertex cover |
scientific article; zbMATH DE number 6246039 |
Statements
Solving min ones 2-SAT as fast as vertex cover (English)
0 references
16 January 2014
0 references
min ones 2-SAT
0 references
vertex cover
0 references
linear programming relaxation
0 references
parameterized complexity
0 references
0 references
