PTAS ДЛЯ ЗАДАЧИ MIN-K-SCCP В ЕВКЛИДОВОМ ПРОСТРАНСТВЕ ПРОИЗВОЛЬНОЙ ФИКСИРОВАННОЙ РАЗМЕРНОСТИ

Translated title of the contribution: A PTAS for the Min--SCCP in a Euclidean space of arbitrary fixed dimension

Research output: Contribution to journalArticlepeer-review

Abstract

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 contributionA PTAS for the Min--SCCP in a Euclidean space of arbitrary fixed dimension
Original languageRussian
Pages (from-to)268-278
Number of pages11
JournalТруды института математики и механики УрО РАН
Volume21
Issue number3
Publication statusPublished - 2015

GRNTI

  • 27.45.00

Level of Research Output

  • VAK List

Fingerprint

Dive into the research topics of 'A PTAS for the Min--SCCP in a Euclidean space of arbitrary fixed dimension'. Together they form a unique fingerprint.

Cite this