A 7/8 -approximation algorithm for metric max TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 205-209

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; TRAVELING SALESMAN PROBLEM;

MAX TSP; MAXIMUM TRAVELING SALESMAN PROBLEM; PERFORMANCE GUARANTEES; RANDOMIZED APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 0348089623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_19     Document Type: Conference Paper

References (3)

1. R. Hassin and S. Rubinstein, “Better approximations for Max TSP”, Information Processing Letters 75 (2000), 181-186.
2. A. V. Kostochka and A. I. Serdyukov, “Polynomial algorithms with the estimates (formula presented) for the traveling salesman problem of the maximum” (in Russian), Upravlyaemye Sistemy 26 (1985) 55-59.
3. A. I. Serdyukov, “An algorithm with an estimate for the traveling salesman problem of the maximum” (in Russian), Upravlyaemye Sistemy 25 (1984) 80-86.