@article{df4c176e39d84a1aa6f0cdbeb2f48940,
title = "Approximation of Euclidean k-size cycle cover problem",
keywords = "vertex-disjoint cycle cover, Traveling Salesman Problem (TSP), NP-hard problem, polynomial-time approximation scheme (PTAS)",
author = "Michael Khachay and Katherine Neznakhina",
year = "2014",
language = "English",
volume = "5",
pages = "177--188",
journal = "Croatian Operational Research Review",
issn = "1848-0225",
publisher = "Croatian Operational Research Society",
number = "2",
}