Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447)
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: Improved approximation algorithms for MAX k-cut and MAX BISECTION |
scientific article; zbMATH DE number 1002567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION |
scientific article; zbMATH DE number 1002567 |
Statements
Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (English)
0 references
9 October 1997
0 references
graph connectivity
0 references
randomized algorithms
0 references
semidefinite programming
0 references
0 references
0.9960559606552124
0 references
0.8932613730430603
0 references
0.8884637355804443
0 references
