An approximation algorithm for the maximum traveling salesman problem (Q293334)
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 6590737
| 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 6590737 |
Statements
An approximation algorithm for the maximum traveling salesman problem (English)
0 references
9 June 2016
0 references
analysis of algorithms
0 references
maximum traveling salesman
0 references
0 references
0.8822968602180481
0 references
0.8813681602478027
0 references
0.8638468384742737
0 references
0.8636922240257263
0 references
0.8596642017364502
0 references
