A 7/8-approximation algorithm for metric Max TSP

Information Processing Letters

Volumn 81, Issue 5, 2002, Pages 247-251

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Analysis of algorithms; Maximum traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; HAMILTONIANS; POLYNOMIALS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

RANDOMIZED APPROXIMATION ALGORITHMS;

APPROXIMATION THEORY;

EID: 0037117175     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00234-4     Document Type: Article

References (7)

1. Finding maximum length tours under polyhedral norms
2. The maximum traveling salesman problem
3. Better approximations for max TSP
4. Polynomial algorithms with the estimates 3/4 and 5/6 for the traveling salesman problem of the maximum
5. A staged primal-dual algorithm for finding a minimum cost perfect two-matching in an undirected graph
6. An algorithm with an estimate for the traveling salesman problem of the maximum