Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891)
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: Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT |
scientific article; zbMATH DE number 1565927
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT |
scientific article; zbMATH DE number 1565927 |
Statements
Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (English)
0 references
18 February 2001
0 references
approximation algorithms
0 references
binary convex quadratic optimization
0 references
combinatorial optimization
0 references
MAX 2SAT
0 references
MAX CUT
0 references
approximate solution
0 references
0 references
0 references
0 references
0.90109503
0 references
0.8978594
0 references
0.89540815
0 references
0.8950284
0 references
0.89396596
0 references
0.89318013
0 references
0.8869429
0 references
