A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282)
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 polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph |
scientific article; zbMATH DE number 6474029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph |
scientific article; zbMATH DE number 6474029 |
Statements
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (English)
0 references
20 August 2015
0 references
NP-hard problem
0 references
polynomial-time approximation scheme
0 references
traveling salesman problem
0 references
cycle cover of size \(k\)
0 references
0 references
0 references
0 references
0.9436081
0 references
0.90156394
0 references
0.8979604
0 references
0.8967089
0 references
0.8952412
0 references
0.8939112
0 references
0.8936144
0 references
0.89360064
0 references
0.88816744
0 references
