Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem (Q2367039)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 232585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem |
scientific article; zbMATH DE number 232585 |
Statements
Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem (English)
0 references
16 August 1993
0 references
worst-case analysis
0 references
tight worst case performance analysis
0 references
convex hull insertion heuristics
0 references
Euclidean travelling salesman
0 references
insertion algorithms
0 references
0.7954863905906677
0 references
0.788743257522583
0 references
0.7799695134162903
0 references
