MAX-CUT has a randomized approximation scheme in dense graphs (Q4885224): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
MAX-CUT has a randomized approximation scheme in dense graphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199605)8:3<187::aid-rsa3>3.0.co;2-u / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109694798 / rank | |||
Normal rank | |||
| Property / title | |||
MAX-CUT has a randomized approximation scheme in dense graphs (English) | |||
| Property / title: MAX-CUT has a randomized approximation scheme in dense graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 11:01, 30 July 2024
scientific article; zbMATH DE number 903458
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
