Improved approximation algorithms for metric MaxTSP

Zhi-Zhong Chen () and Takayuki Nagoya ()
Additional contact information
Zhi-Zhong Chen: Tokyo Denki University
Takayuki Nagoya: Tokyo Denki University

Journal of Combinatorial Optimization, 2007, vol. 13, issue 4, No 2, 336 pages

Abstract: Abstract We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is $$\frac{27}{35}$$ . The other is for undirected graphs and its approximation ratio is $$\frac{7}{8}-o(1)$$ . Both algorithms improve on the previous bests.

Keywords: TSP; Max TSP; Metric Max TSP; Approximation Algorithms; Randomized Algorithms; Derandomization (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-9023-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:13:y:2007:i:4:d:10.1007_s10878-006-9023-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-9023-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().