We study the Min--SCCP on a partition of a complete weighted digraph into vertex-disjoint cycles of minimum total weight. This problem is a generalization of the known traveling salesman problem (TSP) and a special case of the classical vehicle routing problem (VRP). It is known that the problem Min--SCCP is strongly -hard and preserves its intractability even in the geometric statement. For the Euclidean Min--SCCP in with , we construct a polynomial-time approximation scheme, which generalizes the approach proposed earlier for the planar Min-2-SCCP. For any fixed the scheme finds a -approximate solution in time.
|Translated title of the contribution||A PTAS for the Min--SCCP in a Euclidean space of arbitrary fixed dimension|
|Number of pages||11|
|Journal||Труды института математики и механики УрО РАН|
|Publication status||Published - 2015|
Level of Research Output
- VAK List