A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem-Reference-Cited by-同舟云学术

A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem

Published:2009 Issue: Volume: Page:298-311
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Paluch Katarzyna,Mucha Marcin,Ma̧dry Aleksander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03685-9_23

Reference18 articles.

1. Barvinok, A., Gimadi, E.K., Serdyukov, A.I.: The maximun traveling salesman problem. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and its variations, pp. 585–607. Kluwer, Dordrecht (2002)

2. Bhatia, R.: Private communication

3. LNCS;M. Bläser,2005

4. Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Information Processing Letters 95, 333–342 (2005)

5. Chen, Z.-Z., Nagoya, T.: Improved approximation algorithms for metric Max TSP. J.Comb. Optim. 13, 321–336 (2007)

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

1. Approximation of the Double Traveling Salesman Problem with Multiple Stacks;Theoretical Computer Science;2021-07

2. Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension;Optimization Letters;2021-06-16

3. A Polynomial Algorithm with Asymptotic Ratio $$\boldsymbol {2/3}$$ for the Asymmetric Maximization Version of the $$\boldsymbol m $$-PSP;Journal of Applied and Industrial Mathematics;2020-08

4. An Algorithm for the Polyhedral Cycle Cover Problem with Constraints on the Number and Length of Cycles;Proceedings of the Steklov Institute of Mathematics;2019-12

5. Алгоритм для полиэдральной задачи о цикловом покрытии с ограничениями на количество и длину циклов;Trudy Instituta Matematiki i Mekhaniki UrO RAN;2018-09