A 2-approximation algorithm for the metric 2-peripatetic salesman problem (Q3115183)
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 2-approximation algorithm for the metric 2-peripatetic salesman problem |
scientific article; zbMATH DE number 6007825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-approximation algorithm for the metric 2-peripatetic salesman problem |
scientific article; zbMATH DE number 6007825 |
Statements
20 February 2012
0 references
approximation algorithm
0 references
Hamiltonian cycle
0 references
spanning tree
0 references
traveling salesman problem
0 references
0.9965401291847228
0 references
0.9249388575553894
0 references
0.8915021419525146
0 references
0.8638190031051636
0 references
