Approximation algorithms for the maximum 2-peripatetic salesman problem (Q5263758)
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 maximum 2-peripatetic salesman problem |
scientific article; zbMATH DE number 6459994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the maximum 2-peripatetic salesman problem |
scientific article; zbMATH DE number 6459994 |
Statements
Approximation algorithms for the maximum 2-peripatetic salesman problem (English)
0 references
17 July 2015
0 references
traveling salesman problem
0 references
2-peripatetic salesman problem
0 references
polynomial algorithm
0 references
guaranteed approximation ratio
0 references
0.9362850785255432
0 references
0.9186323881149292
0 references
0.894514262676239
0 references
0.8826748132705688
0 references
