Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem

被引：5
|
作者：
Khachay, M. Yu. [1 ]
Neznakhina, E. D. [1 ,2 ]
Ryzhenko, K. V. [1 ]
机构：
[1] Russian Acad Sci, Krasovskii Inst Math & Mech, Ural Branch, Ekaterinburg 620108, Russia
[2] Ural Fed Univ, Ekaterinburg 620000, Russia
来源：
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS | 2022年 / 319卷 / SUPPL 1期
基金：
俄罗斯科学基金会;
关键词：
asymmetric traveling salesman problem; constant-factor approximation algorithm; polynomial-time reduction; Steiner cycle problem; generalized traveling salesman problem; prize collecting traveling salesman problem; vehicle routing problem;
D O I：
10.1134/S0081543822060128
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
For the first time, algorithms with constant performance guarantees are substantiated for a series of asymmetric routing problems of combinatorial optimization: the Steiner cycle problem (SCP), the generalized traveling salesman problem (GTSP), the capacitated vehicle routing problem with unsplittable customer demands (CVRP-UCD), and the prize collecting traveling salesman problem (PCTSP). The presented results are united by the property that they all rely on polynomial cost-preserving reduction to appropriate instances of the asymmetric traveling salesman problem (ATSP) and on the (22 + epsilon)-approximation algorithm for this classical problem proposed by O. Svensson and V. Traub in 2019.
引用
收藏
页码：S140 / S155
页数：16
相关论文
共 14 条
  • [1] Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to Asymmetric Traveling Salesman Problem
    Khachai, M. Yu
    Neznakhina, E. D.
    Ryzhenko, K., V
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2022, 28 (03): : 241 - 258
  • [2] Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem
    M. Yu. Khachay
    E. D. Neznakhina
    K. V. Ryzhenko
    Proceedings of the Steklov Institute of Mathematics, 2022, 319 : S140 - S155
  • [3] A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Svensson, Ola
    Tarnawski, Jakub
    Vegh, Laszlo A.
    JOURNAL OF THE ACM, 2020, 67 (06)
  • [4] A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Svensson, Ola
    Tarnawski, Jakub
    Vegh, Laszlo A.
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 204 - 213
  • [5] Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems
    Neznakhina, E. D.
    Ogorodnikov, Yu. Yu.
    Rizhenko, K. V.
    Khachay, M. Yu.
    DOKLADY MATHEMATICS, 2023, 108 (03) : 499 - 505
  • [6] Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems
    E. D. Neznakhina
    Yu. Yu. Ogorodnikov
    K. V. Rizhenko
    M. Yu. Khachay
    Doklady Mathematics, 2023, 108 : 499 - 505
  • [7] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    An, Hyung-Chan
    Kleinberg, Robert D.
    Shmoys, David B.
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 1 - +
  • [8] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    An, Hyung-Chan
    Kleinberg, Robert D.
    Shmoys, David B.
    ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (04)
  • [9] Constant-factor approximation algorithms for domination problems on circle graphs
    Damian-Iordache, M
    Pemmaraju, SV
    ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 70 - 82
  • [10] Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs
    Ding, Wei
    Qiu, Ke
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2019, 2019, 11640 : 62 - 71
12