Summary
In the report polynomial approximation algorithms with performance guarantees are presented for some modifications of TSP: for the minimum-weigt 2-PSP on metric distances and for the maximum-weight m- PSP in Euclidean space Rk.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
1. Ageev A., Baburin A, Gimadi E. (2007)A 3/4-Approximation Algorithm for Finding Two Disjoint Hamiltonian Cycles of Maximum Weight. Journal of Applied and Industrial Mathematics. 1(2): 142–147.
2. Alexander A. Ageev and Artem V. Pyatkin (2008) A 2-Approximation Algorithm for the Metric 2-PSP. WAOA 2007 (Eds.: C. Kaklamanis and M. Skutella), LNCS, Springer-Verlag Berlin Heidelberg, 4927: 103–115.
3. Baburin A., Gimadi E., Korkishko N.(2004) Approximation algorithms for finding two disjoint Hamiltonian circuits of minimal total weight. Discrete Analysis and Operations Research. Ser. 2. 11(1): 11–25 (in Russian).
Baburin E., Gimadi E.(2005) Approximation algorithms for finding a maximum-weight spanning connected subgraph with given vertex degrees. Oper. Res. Proc. 2004, Intern. Conf. OR 2004, Tilburg. Springer, Berlin, 343–351.
Berman P., Karpinski M. (2006) 8/7-approximation algorithm for (1,2)-TSP. Proc. 17th ACM-SIAM SODA: 641–648.
Christofides N. (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. Tech. Rep. CS-93-13, Carnegie Mellon University.
Croce F. D., Pashos V. Th., Calvo R. W. (2005) Approximating the 2-peripatetic salesman problem. 7th Workshop on MAPS 2005. (Siena, Italy, June 6–10): 114–116.
8. De Kort, J.B.J.M. (1993) A branch and bound algorithm for symmetric 2-peripatetic salesman problems. European J. of Oper. Res. 70: 229–243.
9. Gimadi E.Kh., Glazkov Y.V., Glebov A.N. (2007) Approximation algorithms for two salespersons in complete graph with edge weights 1 and 2. Discrete Analysis and Operations Research. Ser. 2, Novosibirsk. 14(2): 41–61 (in Russian).
Krarup J. (1975) The peripatetic salesman and some related unsolved problems. Combinatorial programming: methods and applications (Proc. NATO Advanced Study Inst., Versailles, 1974): 173–178.
11. Papadimitriu C. H., Yannakakis M. (1993) The traveling salesman problem with distance One and Two. Math. Oper. Res. 18(1): 1–11.
12. Roskind J., Tarjan R.E. (1985) A note on finding minimum-cost edge-disjoint spanning trees. Math. Oper. Res. 10(4): 701–708.
13. Serdjukov A.I. (1978) Some extremal bypasses in graphs. Upravlyaemye Sistemy, Novosibirsk 17(89): 76–79 (in Russian).
The Traveling Salesman Problem and its Variations. Gutin G., Punnen A. P. (eds.) (2002) Kluwer Acad. Publishers, Dordrecht/Boston/London.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gimadi, E. (2009). Approximation Polynomial Algorithms for Some Modifications of TSP. In: Fleischmann, B., Borgwardt, KH., Klein, R., Tuma, A. (eds) Operations Research Proceedings 2008., vol 2008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00142-0_72
Download citation
DOI: https://doi.org/10.1007/978-3-642-00142-0_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00141-3
Online ISBN: 978-3-642-00142-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)