Max-Cut
E1501285
UNEXPLORED
Max-Cut is a fundamental NP-hard problem in graph theory and combinatorial optimization that seeks a partition of a graph’s vertices into two sets to maximize the number (or total weight) of edges crossing between them.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Max-Cut canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21763349 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Max-Cut Context triple: [Max-E3-LIN-2, relatedProblem, Max-Cut]
-
A.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
-
B.
Steiner tree problem
The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
-
C.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
D.
Max-SAT
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
E.
Steiner forest problem
The Steiner forest problem is a combinatorial optimization problem that seeks a minimum-cost forest connecting specified pairs or groups of terminals in a graph, generalizing the classical Steiner tree problem to multiple disjoint terminal sets.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Max-Cut Target entity description: Max-Cut is a fundamental NP-hard problem in graph theory and combinatorial optimization that seeks a partition of a graph’s vertices into two sets to maximize the number (or total weight) of edges crossing between them.
-
A.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
-
B.
Steiner tree problem
The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
-
C.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
D.
Max-SAT
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
E.
Steiner forest problem
The Steiner forest problem is a combinatorial optimization problem that seeks a minimum-cost forest connecting specified pairs or groups of terminals in a graph, generalizing the classical Steiner tree problem to multiple disjoint terminal sets.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.