Approximating asymmetric TSP in exponential time (Q5168426)
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 6313583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating asymmetric TSP in exponential time |
scientific article; zbMATH DE number 6313583 |
Statements
APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME (English)
0 references
4 July 2014
0 references
TSP
0 references
traveling salesman problem
0 references
asymmetric traveling salesman problem
0 references
approximation scheme
0 references
exponential-time algorithm
0 references
0 references
0 references
0.8200241923332214
0 references
0.8092439770698547
0 references
0.8024704456329346
0 references
