Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION (Q3499508)
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 5281725
| 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 5281725 |
Statements
2 June 2008
0 references
0.9960559606552124
0 references
0.8935962319374084
0 references
0.8865576982498169
0 references
0.8856321573257446
0 references
