Approximability of the minimum-weight k-size cycle cover problem

Original language	English
Pages (from-to)	65-82
Number of pages	18
Journal	Journal of Global Optimization
Volume	66
Issue number	1
DOIs	https://doi.org/10.1007/s10898-015-0391-3
Publication status	Published - 1 Sept 2016

Cycle cover problem (CCP), NP-hard problem, Polynomial-time approximation scheme (PTAS), Traveling salesman problem (TSP)

ID: 1091895