Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (Q55934039)
Jump to navigation
Jump to search
scholarly article by Michel Goemans & David P. Williamson published 1 November 1995 in Journal of the ACM
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming |
scholarly article by Michel Goemans & David P. Williamson published 1 November 1995 in Journal of the ACM |
Statements
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (English)
0 references
1 November 1995
0 references
42
0 references
6
0 references
1115-1145
0 references