An Improved Randomized Approximation Algorithm for Max TSP

Zhi-Zhong Chen () and Lusheng Wang
Additional contact information
Zhi-Zhong Chen: Tokyo Denki University
Lusheng Wang: City University of Hong Kong

Journal of Combinatorial Optimization, 2005, vol. 9, issue 4, No 5, 432 pages

Abstract: Abstract We present an O(n3)-time randomized approximation algorithm for the maximum traveling salesman problem whose expected approximation ratio is asymptotically $$\frac{251}{331}$$ , where n is the number of vertices in the input (undirected) graph. This improves the previous best.

Keywords: Max TSP; approximation algorithms; randomized algorithms; graph algorithms (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-1779-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:9:y:2005:i:4:d:10.1007_s10878-005-1779-7

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

DOI: 10.1007/s10878-005-1779-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 ().