|
gptkbp:instanceOf
|
gptkb:theoretical_computer_science
gptkb:graph
|
|
gptkbp:approximationAlgorithm
|
gptkb:Goemans–Williamson_algorithm
|
|
gptkbp:approximationRatio
|
0.878
|
|
gptkbp:category
|
gptkb:theoretical_computer_science
gptkb:mathematical_optimization
|
|
gptkbp:complexity
|
gptkb:NP-hard
|
|
gptkbp:decision
|
Is there a cut of size at least k?
|
|
gptkbp:definedIn
|
gptkb:graph
|
|
gptkbp:field
|
gptkb:theoretical_computer_science
combinatorial optimization
|
|
gptkbp:firstDescribed
|
1970s
|
|
gptkbp:goal
|
partition the vertices into two sets to maximize the number of edges between the sets
|
|
gptkbp:hasExactAlgorithm
|
exponential time algorithm
|
|
gptkbp:hasPolynomialTimeAlgorithm
|
no (unless P=NP)
|
|
gptkbp:hasSpecialCase
|
gptkb:Boolean_satisfiability_problem
gptkb:quadratic_unconstrained_binary_optimization_(QUBO)
|
|
gptkbp:hasUnweightedVersion
|
yes
|
|
gptkbp:hasWeightedVersion
|
yes
|
|
gptkbp:input
|
gptkb:graph
|
|
gptkbp:output
|
partition of vertices
|
|
gptkbp:reduces
|
gptkb:Ising_model
gptkb:3-SAT
|
|
gptkbp:relatedTo
|
gptkb:Boolean_satisfiability_problem
minimum cut problem
|
|
gptkbp:solvedBy
|
semidefinite programming
|
|
gptkbp:usedIn
|
statistical physics
VLSI design
network design
circuit layout design
|
|
gptkbp:bfsParent
|
gptkb:Goemans–Williamson_algorithm
|
|
gptkbp:bfsLayer
|
8
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
MAX-CUT problem
|