Polynomial-time approximation scheme for a Euclidean problem on a cycle covering of a graph

被引：0

作者：

Khachai, M. Yu. ^{[1
]}

Neznakhina, E. D. ^{[2
]}

机构：

[1] Yeltsin Ural Fed Univ, Russian Acad Sci, Ural Branch, Inst Math & Mech,Phys Mat Sci, Ekaterinburg, Russia

[2] Yeltsin Ural Fed Univ, Russian Acad Sci, Ural Branch, Inst Math & Mech, Ekaterinburg, Russia

来源：

TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN | 2014年 / 20卷 / 04期

关键词：

NP-hard problem; polynomial-time approximation scheme (PTAS); traveling salesman problem (TSP); cycle covering of size k;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We study the Min-k-SCCP problem on a partition of a complete weighted digraph into k vertex-disjoint cycles of minimum total weight. This problem is a natural generalization of the known Traveling salesman problem (TSP) and has a number of applications in operations research and data analysis. We show that the problem is strongly NP-hard and preserves intractability even in the geometric statement. For a metric special case of the problem, a new polynomial 2-approximation algorithm is proposed. For the Euclidean Min-2-SCCP, a polynomial-time approximation scheme based on Arora's approach is built.

引用

页码：297 / 311

页数：15

共 50 条

[1] A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
M. Yu. Khachai
E. D. Neznakhina
Proceedings of the Steklov Institute of Mathematics, 2015, 289 : 111 - 125
[2] A Polynomial-Time Approximation Scheme for the Euclidean Problem on a Cycle Cover of a Graph
Khachai, M. Yu.
Neznakhina, E. D.
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2015, 289 : S111 - S125
[3] A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
Borradaile, Glencora
Klein, Philip N.
Mathieu, Claire
ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (03)
[4] A polynomial-time approximation scheme for Euclidean Steiner forest
Borradaile, Glencora
Klein, Philip N.
Mathieu, Claire
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 115 - +
[5] A Polynomial-Time Approximation Scheme for Embedding Hypergraph in a Cycle
Li, Guojun
Deng, Xiaotie
Xu, Ying
ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (02)
[6] A polynomial-time approximation scheme for the airplane refueling problem
Gamzu, Iftah
Segev, Danny
JOURNAL OF SCHEDULING, 2019, 22 (01) : 119 - 135
[7] A polynomial-time approximation scheme for the airplane refueling problem
Iftah Gamzu
Danny Segev
Journal of Scheduling, 2019, 22 : 119 - 135
[8] A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem
da Silva, Mauro R. C.
Schouery, Rafael C. S.
Pedrosa, Lehilton L. C.
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 699 - 710
[9] Polynomial-time approximation schemes for the Euclidean survivable network design problem
Czumaj, A
Lingas, A
Zhao, HR
AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 973 - 984
[10] Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
Kel'manov, A. V.
Khandeev, V. I.
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2016, 56 (02) : 334 - 341

← 1 2 3 4 5 →