Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503)
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: Approximability of the minimum-weight k-size cycle cover problem |
scientific article; zbMATH DE number 6643282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of the minimum-weight \(k\)-size cycle cover problem |
scientific article; zbMATH DE number 6643282 |
Statements
Approximability of the minimum-weight \(k\)-size cycle cover problem (English)
0 references
26 October 2016
0 references
cycle cover problem (CCP)
0 references
traveling salesman problem (TSP)
0 references
NP-hard problem
0 references
polynomial-time approximation scheme (PTAS)
0 references
0 references
0 references
0 references
0.940008282661438
0 references
0.9231826066970824
0 references
0.9204685091972352
0 references
0.8562931418418884
0 references
0.8338109850883484
0 references
