Approximation algorithms for the traveling salesman problem (Q1812290)
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: Approximation algorithms for the traveling salesman problem |
scientific article; zbMATH DE number 1932769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the traveling salesman problem |
scientific article; zbMATH DE number 1932769 |
Statements
Approximation algorithms for the traveling salesman problem (English)
0 references
23 June 2003
0 references
approximation algorithm
0 references
NP-complete problem
0 references
traveling salesman
0 references
0.8893839716911316
0 references
0.8632925152778625
0 references
0.8491858839988708
0 references
