A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph |
scientific article |
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
