An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Q5360842)
From MaRDI portal
scientific article; zbMATH DE number 6780539
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(log <i>n</i>/log log <i>n</i>)-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
