Traveling salesman problem (decision version)
GPTKB entity
Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:category |
combinatorial optimization
graph theory |
| 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)
|
| https://www.w3.org/2000/01/rdf-schema#label |
Traveling salesman problem (decision version)
|
| gptkbp:input |
weighted graph
integer k |
| gptkbp:reduces |
gptkb:Hamiltonian_cycle_problem
|
| gptkbp:relatedTo |
gptkb:Traveling_salesman_problem
NP-complete 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:NP-completeness
|
| gptkbp:bfsLayer |
5
|