A PTAS for Min-k-SCCP in Euclidean space of arbitrary fixed dimension

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	120-130
Number of pages	11
Journal	Proceedings of the Steklov Institute of Mathematics
Volume	295
DOIs	https://doi.org/10.1134/S0081543816090133
Publication status	Published - 1 Dec 2016

cycle cover of size k, NP-hard problem, polynomialtime approximation scheme, traveling salesman problem

ID: 1478720