Reducing path TSP to TSP-Reference-Cited by-同舟云学术

Reducing path TSP to TSP

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Traub Vera¹,Vygen Jens¹,Zenklusen Rico²

Affiliation:

1. University of Bonn, Germany

2. ETH Zurich, Switzerland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357713.3384256

Reference24 articles.

1. Improving Christofides' Algorithm for the s-t Path TSP

2. Approximation Algorithms for Orienteering and Discounted-Reward TSP

3. Approximating Minimum-Cost Connected T-Joins

4. Z. Gao. An LP-based 3 2 -approximation algorithm for the s-t path graph traveling salesman problem. Operations Research Letters 41:615–617 2013. Z. Gao. An LP-based 3 2 -approximation algorithm for the s-t path graph traveling salesman problem. Operations Research Letters 41:615–617 2013.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Asymmetric Dominated Multiobjective Optimization Algorithm for Reducing Energy Consumption of WSN Operation;IEEE Sensors Journal;2024-07-15

2. A spanning tree algorithm with adaptive pruning with low redundancy coverage rate;Computers & Industrial Engineering;2023-12

3. Recognising permuted Demidenko matrices;Operations Research Letters;2023-09

4. Study on the Use of the Ant Colony Algorithm and Genetic Algorithm for Travelling Salesman Problem Path Planning;2023 International Conference on Data Science & Informatics (ICDSI);2023-08-12

5. Predicting drivers’ route trajectories in last-mile delivery using a pair-wise attention-based pointer neural network;Transportation Research Part E: Logistics and Transportation Review;2023-07