Karp's 21 NP-complete problems
GPTKB entity
Statements (62)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:chess_match
|
| gptkbp:bfsLayer |
4
|
| gptkbp:bfsParent |
gptkb:Richard_M._Karp
gptkb:M._Richard_(Dick)_Karp gptkb:Richard_Karp |
| https://www.w3.org/2000/01/rdf-schema#label |
Karp's 21 NP-complete problems
|
| gptkbp:includes |
Boolean satisfiability problem
Clique problem Feedback vertex set problem Graph coloring problem Job scheduling problem Knapsack problem Maximum cut problem Partition problem Set cover problem Steiner tree problem Traveling salesman problem Vertex cover problem Graph isomorphism problem Subset sum problem Hamiltonian path problem Dominating set problem Exact cover problem Longest path problem Subset product problem 3-SAT problem Graph partitioning problem Hitting set problem Longest common subsequence problem Minimum spanning tree problem Minimum vertex cover problem Multi-agent pathfinding problem Multi-criteria decision making problem Multi-dimensional bin packing problem Multi-dimensional knapsack problem Multi-dimensional resource allocation problem Multi-dimensional traveling salesman problem Multi-objective optimization problem Multicolored clique problem Network design problem Resource allocation problem Set packing problem Traveling salesman problem with time windows Bin packing problem Facility location problem Job shop scheduling problem Maximum independent set problem Maximum satisfiability problem Minimum cost flow problem Minimum dominating set problem Minimum feedback arc set problem Multi-commodity flow problem Multi-dimensional assignment problem Multi-dimensional facility location problem Multi-dimensional knapsack problem with conflicts Multi-dimensional matching problem Network flow problem Steiner tree problem in graphs Subset sum with repetitions problem Traveling salesman problem with profits |
| gptkbp:proposed_by |
gptkb:Richard_Karp
|
| gptkbp:published_by |
gptkb:1972
|