A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480)
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: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time |
scientific article; zbMATH DE number 33322
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time |
scientific article; zbMATH DE number 33322 |
Statements
A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (English)
0 references
28 June 1992
0 references
traveling salesman problem
0 references
dynamic programming algorithm
0 references
Monge arrays
0 references
0 references
0 references
0.90587854
0 references
0 references
0.8847269
0 references
0 references
0.8807547
0 references
0.88042295
0 references
0.87329936
0 references
0.87107646
0 references
0.8706242
0 references
0.87054855
0 references
