A constant-factor approximation algorithm for the asymmetric traveling salesman problem (Q5230290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7096997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constant-factor approximation algorithm for the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 7096997 |
Statements
A constant-factor approximation algorithm for the asymmetric traveling salesman problem (English)
0 references
22 August 2019
0 references
approximation algorithms
0 references
asymmetric traveling salesman problem
0 references
combinatorial optimization
0 references
linear programming
0 references
0.9602853059768676
0 references
0.8767746090888977
0 references
0.8698670864105225
0 references
0.8460138440132141
0 references
