Abstract
We study the minimum weight k-size cycle cover problem (Min-k-SCCP), which consists in partitioning a complete weighted digraph into k vertex-disjoint cycles of minimum total weight. This problem is a generalization of the known traveling salesman problem and a special case of the classical vehicle routing problem. It is known that Min-k-SCCP is strongly NP-hard in the general case and preserves its intractability even in the geometric statement. For Euclidean Min-k-SCCP in ℝ d with k = O(log n), we construct a polynomialtime approximation scheme (PTAS), which generalizes the approach proposed earlier for planar Min-2-SCCP. For each fixed c > 1 the scheme finds a (1 + 1/c)-approximate solution in time \(O\left( {{n^{O\left( d \right)}}{{\left( {\log n} \right)}^{{{\left( {O\left( {\sqrt {dc} } \right)} \right)}^{^{d - 1}}}}}} \right)\).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Steklov Institute of Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
