A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP (Q4973249)
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: A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP |
scientific article; zbMATH DE number 7139182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP |
scientific article; zbMATH DE number 7139182 |
Statements
A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP (English)
0 references
2 December 2019
0 references
Hamiltonian cycle
0 references
traveling salesman problem
0 references
\(m\)-peripatetic salesman problem
0 references
approximation algorithm
0 references
guaranteed approximation ratio
0 references
0 references
0 references
0 references
0 references
0 references
0.8883747458457947
0 references
0.870152473449707
0 references
0.8267152309417725
0 references
0.8193557858467102
0 references
0.8162757158279419
0 references
