The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial (Q6285331)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial |
scientific article; zbMATH DE number 900312372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial |
scientific article; zbMATH DE number 900312372 |
Statements
10 April 2017
0 references
math.CO
0 references
cs.DS
0 references
