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 条
  • [21] Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm
    Theile, Madeleine
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2009, 5482 : 145 - +
  • [22] LP-based approximation algorithms for capacitated facility location
    Levi, Retsef
    Shmoys, David B.
    Swamy, Chaitanya
    MATHEMATICAL PROGRAMMING, 2012, 131 (1-2) : 365 - 379
  • [23] An LP-based heuristic algorithm for the node capacitated in-tree packing problem
    Tanaka, Yuma
    Imahori, Shinji
    Sasaki, Mihiro
    Yagiura, Mutsunori
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 637 - 646
  • [24] LP-based approximation algorithms for capacitated facility location
    Retsef Levi
    David B. Shmoys
    Chaitanya Swamy
    Mathematical Programming, 2012, 131 : 365 - 379
  • [25] LP-based approximation algorithms for capacitated facility location
    Levi, R
    Shmoys, DB
    Swamy, C
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3064 : 206 - 218
  • [26] An LP-based hybrid heuristic procedure for the generalized assignment problem with special ordered sets
    French, AP
    Wilson, JM
    HYBRID METAHEURISTICS, PROCEEDINGS, 2005, 3636 : 12 - 20
  • [27] LP-Based Approximation Algorithms for Reliable Resource Allocation
    Liao, Kewen
    Shen, Hong
    COMPUTER JOURNAL, 2014, 57 (01): : 154 - 164
  • [28] LP-based optimal path planning in acceleration space
    Zu, Di
    Han, Handa
    Tan, Dalong
    2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS, VOLS 1-3, 2006, : 1340 - +
  • [29] An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters
    Borgwardt, Steffen
    OPERATIONAL RESEARCH, 2022, 22 (02) : 1511 - 1551
  • [30] A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
    Olaf Mersmann
    Bernd Bischl
    Heike Trautmann
    Markus Wagner
    Jakob Bossek
    Frank Neumann
    Annals of Mathematics and Artificial Intelligence, 2013, 69 : 151 - 182
12345