Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:abbreviation |
gptkb:Max-Cut
|
| gptkbp:application |
statistical physics
network design circuit layout design |
| gptkbp:approximationAlgorithm |
gptkb:Goemans–Williamson_algorithm
|
| gptkbp:approximationRatio |
0.878
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a graph, the problem of partitioning the vertices into two sets such that the number of edges between the sets is maximized.
|
| gptkbp:field |
gptkb:mathematics
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Maximum cut problem
|
| gptkbp:relatedTo |
graph theory
randomized algorithms approximation algorithms semidefinite programming minimum cut problem NP-hard problem |
| gptkbp:solvableInPolynomialTime |
for bipartite graphs
for planar graphs |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|