The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355)
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 approximation ratio of the greedy algorithm for the metric traveling salesman problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The approximation ratio of the greedy algorithm for the metric traveling salesman problem |
scientific article |
Statements
The approximation ratio of the greedy algorithm for the metric traveling salesman problem (English)
0 references
28 September 2018
0 references
traveling salesman problem
0 references
greedy algorithm
0 references
Clarke-Wright savings heuristic
0 references
approximation algorithm
0 references
0.8420131206512451
0 references
0.8044979572296143
0 references
0.7999849915504456
0 references
0.7992033362388611
0 references
0.7987545132637024
0 references
