Traveling Salesman Problem (decision version)
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:estimatedCost |
no (unless P=NP)
|
| gptkbp:field |
operations research
theoretical computer science |
| gptkbp:firstProvedNPCompleteBy |
gptkb:Richard_Karp
|
| gptkbp:hasOptimizationVersion |
gptkb:Traveling_Salesman_Problem_(optimization_version)
|
| gptkbp:hasSpecialCase |
gptkb:Hamiltonian_cycle_problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Traveling Salesman Problem (decision version)
|
| gptkbp:input |
weighted graph
integer k |
| gptkbp:relatedTo |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:type |
Is there a Hamiltonian cycle of total weight at most k?
|
| gptkbp:usedIn |
gptkb:complexity_theory
algorithm design |
| gptkbp:yearNPCompletenessProved |
1972
|
| gptkbp:bfsParent |
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972) |
| gptkbp:bfsLayer |
6
|