A near-optimal approximation algorithm for asymmetric TSP on embedded graphs (Q4635535)
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 near-optimal approximation algorithm for asymmetric TSP on embedded graphs |
scientific article; zbMATH DE number 6863010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A near-optimal approximation algorithm for asymmetric TSP on embedded graphs |
scientific article; zbMATH DE number 6863010 |
Statements
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs (English)
0 references
23 April 2018
0 references
approximation algorithms
0 references
topological graph algorithms
0 references
traveling salesman
0 references
0.8913679122924805
0 references
0.8800346851348877
0 references
0.8045692443847656
0 references
0.8045622706413269
0 references
0.8021244406700134
0 references
