NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT (Q4446321)
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: NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT |
scientific article; zbMATH DE number 2032474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT |
scientific article; zbMATH DE number 2032474 |
Statements
NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT (English)
0 references
22 March 2004
0 references
algorithm
0 references
combinatorial optimization
0 references
nonlinear programming
0 references
0.8966830372810364
0 references
0.8741557598114014
0 references
