Approximating the metric TSP in linear time (Q649110): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:48, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the metric TSP in linear time |
scientific article |
Statements
Approximating the metric TSP in linear time (English)
0 references
30 November 2011
0 references
traveling salesman problem
0 references
metric graphs
0 references
NP-hardness
0 references
linear-time approximation algorithms
0 references
