A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem

被引：0
|
作者：
Sun, Jian [1 ]
Gutin, Gregory [2 ]
Zhang, Xiaoyan [3 ,4 ]
机构：
[1] Beijing Univ Technol, Dept Operat Res & Informat Engn, Beijing 100124, Peoples R China
[2] Royal Holloway Univ London, Dept Comp Sci, Egham TW20 0EX, Surrey, England
[3] Nanjing Normal Univ, Sch Math Sci, Nanjing 210023, Jiangsu, Peoples R China
[4] Nanjing Normal Univ, Inst Math, Nanjing 210023, Jiangsu, Peoples R China
来源：
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021 | 2021年 / 13135卷
基金：
中国国家自然科学基金;
关键词：
Hamiltonian path; LP rounding; Generalized TSP path problem; Approximation algorithm;
D O I：
10.1007/978-3-030-92681-6_50
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Hamiltonian path problem is one of the fundamental problems in graph theory, the aim is to find a path in the graph that visits each vertex exactly once. In this paper, we consider a generalizedized problem: given a complete weighted undirected graph G = (V, E, c), two specified vertices s and t, let V' and E' be subsets of V and E, respectively. We aim to find an s-t path which visits each vertex of V' and each edge of E' exactly once with minimum cost. Based on LP rounding technique, we propose a 9-root 33/2-approximation algorithm.
引用
收藏
页码：641 / 652
页数：12
相关论文
共 50 条
  • [1] An LP-based approximation algorithm for the generalized traveling salesman path problem
    Sun, Jian
    Gutin, Gregory
    Li, Ping
    Shi, Peihao
    Zhang, Xiaoyan
    THEORETICAL COMPUTER SCIENCE, 2023, 941 : 180 - 190
  • [2] An LP-based 3/2-approximation algorithm for the s-t path graph Traveling Salesman Problem
    Gao, Zhihan
    OPERATIONS RESEARCH LETTERS, 2013, 41 (06) : 615 - 617
  • [3] A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
    Bamas, Etienne
    Drygala, Marina
    Svensson, Ola
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2022, 2022, 13265 : 57 - 69
  • [4] LP-based approximation for uniform capacitated facility location problem
    Grover, Sapna
    Gupta, Neelima
    Khuller, Samir
    DISCRETE OPTIMIZATION, 2022, 45
  • [5] A note on LP-based approximation algorithms for capacitated facility location problem
    Miao, Runjie
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2022, 932 : 31 - 40
  • [6] An LP-based algorithm for the data association problem in multitarget tracking
    Storms, PPA
    Spieksma, FCR
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (07) : 1067 - 1085
  • [7] Delegate and conquer: An LP-based approximation algorithm for minimum degree MSTs
    Ravi, R.
    Singh, Mohit
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 169 - 180
  • [8] Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
    Makarychev, Konstantin
    Manokaran, Rajsekar
    Sviridenko, Maxim
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2010, 6198 : 594 - +
  • [9] Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
    Makarychev, Konstantin
    Manokaran, Rajsekar
    Sviridenko, Maxim
    ACM TRANSACTIONS ON ALGORITHMS, 2014, 10 (04)
  • [10] Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
    Jaszkiewicz, Andrzej
    Zielniewicz, Piotr
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (03) : 885 - 890
12345