Approximation of Euclidean k-size cycle cover problem (Q3455967): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.17535/crorr.2014.0006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2136627087 / rank | |||
Normal rank | |||
Revision as of 01:00, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of Euclidean k-size cycle cover problem |
scientific article |
Statements
Approximation of Euclidean k-size cycle cover problem (English)
0 references
11 December 2015
0 references
vertex-disjoint cover
0 references
traveling salesman problem
0 references
NP-hard problem
0 references
polynomial-time approximation scheme
0 references
