Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/complexity-and-approximability-of-the-euclidean-generalized-traveling-WOI97ilrq6
References (18)
-
AG Chentsov, MY Khachai, DM Khachai (2016)
An exact algorithm with linear complexity for a problem of visiting megalopolisesProc. Steklov Instit. Math., 295
-
S Arora (1998)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJ. ACM, 45
-
K Elbassioni, A Fishkin, R Sitters (2009)
Approximation algorithms for the euclidean traveling salesman problem with discrete and continuous neighborhoodsInt. J. Comput. Geom. Appl., 19
-
C Feremans, A Grigoriev, R Sitters (2006)
The geometric generalized minimum spanning tree problem with grid clustering4OR, 4
-
M Fischetti, JJS González, P Toth (1997)
A branch-and-cut algorithm for the symmetric generalized traveling salesman problemOper. Res., 45
-
A Chentsov, M Khachay, D Khachay (2016)
Linear time algorithm for precedence constrained asymmetric generalized traveling salesman problemIFAC-PapersOnLine, 49
-
M Khachay, K Neznakhina (2016)
Approximability of the minimum-weight k-size cycle cover problemJ. Glob. Optim., 66
-
G Gutin, AP Punnen (2007)
The Traveling Salesman Problem and Its Variations -
MY Khachai, ED Neznakhina (2017)
Approximation schemes for the generalized traveling salesman problemProc. Steklov Instit. Math., 299
-
C Papadimitriou (1977)
Euclidean TSP is NP-completeTheoret. Comput. Sci., 4
-
E Balas, N Simonetti (2001)
Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational studyINFORMS J. Comput., 13
-
JS Mitchell (1999)
Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric tsp, k-mst, and related problemsSIAM J. Comput., 28
-
M Dror, JB Orlin (2008)
Combinatorial optimization with explicit delineation of the ground set by a collection of subsetsSIAM J. Discret. Math., 21
-
E Balas (1999)
New classes of efficiently solvable generalized traveling salesman problemsAnn. Oper. Res., 86
-
M Khachai, E Neznakhina (2015)
A polynomial-time approximation scheme for the euclidean problem on a cycle cover of a graphProc. Steklov Instit. Math., 289
-
A Dumitrescu, CD Tóth (2016)
The traveling salesman problem for lines, balls, and planesACM Trans. Algor., 12
-
M Haimovich, AHG Rinnooy Kan (1985)
Bounds and heuristics for capacitated routing problemsMath. Oper. Res., 10
-
EM Arkin, R Hassin (1994)
Approximation algorithms for the geometric covering salesman problemDiscrete Appl. Math., 55
- Publisher
- Springer Journals
- Copyright
- Copyright © Springer Nature Switzerland AG 2019
- Subject
- Computer Science; Artificial Intelligence; Mathematics, general; Computer Science, general; Complex Systems
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1007/s10472-019-09626-w
- Publisher site
- See Article on Publisher Site
Abstract
We consider the geometric version of the well-known Generalized Traveling Salesman Problem introduced in 2015 by Bhattacharya et al. that is called the Euclidean Generalized Traveling Salesman Problem in Grid Clusters (EGTSP-GC). They proved the intractability of the problem and proposed first polynomial time algorithms with fixed approximation factors. The extension of these results in the field of constructing the polynomial time approximation schemes (PTAS) and the description of non-trivial polynomial time solvable subclasses for the EGTSP-GC appear to be relevant in the light of the classic C. Papadimitriou result on the intractability of the Euclidean TSP and recent inapproximability results for the Traveling Salesman Problem with Neighborhoods (TSPN) in the case of discrete neighborhoods. In this paper, we propose Efficient Polynomial Time Approximation Schemes (EPTAS) for two special cases of the EGTSP-GC, when the number of clusters k=O(logn)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$k=O(\log n)$\end{document} and k=n−O(logn)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$k=n-O(\log n)$\end{document}. Also, we show that any time, when one of the grid dimensions (height or width) is fixed, the EGTSP-GC can be solved to optimality in polynomial time. As a consequence, we specify a novel non-trivial polynomially solvable subclass of the Euclidean TSP in the plane.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 28, 2020