MAX-CUT has a randomized approximation scheme in dense graphs (Q4885224)
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: Publication:4885224 |
scientific article; zbMATH DE number 903458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MAX-CUT has a randomized approximation scheme in dense graphs |
scientific article; zbMATH DE number 903458 |
Statements
24 October 1996
0 references
cut in a graph
0 references
maximum cut problem
0 references
randomized algorithm
0 references
polynomial time
0 references
MAX-CUT has a randomized approximation scheme in dense graphs (English)
0 references
0.8175594806671143
0 references
0.8151329755783081
0 references
0.8148491382598877
0 references
