An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem (Q5360842)
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 6780539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 6780539 |
Statements
An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem (English)
0 references
26 September 2017
0 references
traveling salesman problem
0 references
linear programming
0 references
maximum entropy
0 references
thin tree
0 references
Held-Karp relaxation
0 references
randomized rounding
0 references
0.915267050266266
0 references
0.8510109186172485
0 references
0.8422490358352661
0 references
0.840612530708313
0 references
