Engineering an approximation scheme for traveling salesman in planar graphs (Q4580152)
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: Engineering an approximation scheme for traveling salesman in planar graphs |
scientific article; zbMATH DE number 6917123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Engineering an approximation scheme for traveling salesman in planar graphs |
scientific article; zbMATH DE number 6917123 |
Statements
13 August 2018
0 references
traveling salesman
0 references
approximation schemes
0 references
planar graph algorithms
0 references
algorithm engineering
0 references
Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs (English)
0 references
0.8572062253952026
0 references
0.8318008184432983
0 references
0.7808874249458313
0 references
