A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766): Difference between revisions
From MaRDI portal
Latest revision as of 11:25, 30 July 2024
scientific article; zbMATH DE number 6466121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem |
scientific article; zbMATH DE number 6466121 |
Statements
A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (English)
0 references
27 July 2015
0 references
traveling salesman problem
0 references
2-peripatetic salesman problem
0 references
polynomial algorithm
0 references
guaranteed accuracy bound
0 references
directed graph
0 references
0 references
