The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4191856 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the nearest neighbor rule for the metric traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the nearest neighbor rule for the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-case analysis of two travelling salesman heuristics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank | |||
Normal rank | |||
Latest revision as of 17:47, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
