A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330)
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 linear time algorithm for the bottleneck traveling salesman problem on a Halin graph |
scientific article; zbMATH DE number 6590734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph |
scientific article; zbMATH DE number 6590734 |
Statements
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (English)
0 references
9 June 2016
0 references
bottleneck traveling salesman problem
0 references
polynomial algorithms
0 references
computational complexity
0 references
Halin graph
0 references
0.8023439049720764
0 references
0.8022120594978333
0 references
0.7993238568305969
0 references
0.7856687903404236
0 references
