An approximation algorithm for the maximum traveling salesman problem (Q4972196)
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: An approximation algorithm for the maximum traveling salesman problem |
scientific article; zbMATH DE number 7135748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the maximum traveling salesman problem |
scientific article; zbMATH DE number 7135748 |
Statements
An Approximation Algorithm for the Maximum Traveling Salesman Problem (English)
0 references
23 November 2019
0 references
Hamiltonian cycle
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
cycle cover
0 references
matching
0 references
accuracy of solution
0 references
0.8822968602180481
0 references
0.8423475027084351
0 references
0.8314922451972961
0 references
