Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141)
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: Worst-case analysis of a new heuristic for the travelling salesman problem |
scientific article; zbMATH DE number 7500864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case analysis of a new heuristic for the travelling salesman problem |
scientific article; zbMATH DE number 7500864 |
Statements
Worst-case analysis of a new heuristic for the travelling salesman problem (English)
0 references
31 March 2022
0 references
triangularity condition
0 references
shortest spanning tree
0 references
worst-case analysis
0 references
0.8623093962669373
0 references
0.859863817691803
0 references
0.8529017567634583
0 references
0.8450512886047363
0 references
