TY - JOUR
T1 - A 7/8-approximation algorithm for metric Max TSP
AU - Hassin, Refael
AU - Rubinstein, Shlomi
PY - 2002/3/16
Y1 - 2002/3/16
N2 - A randomized approximation algorithm for the metric version of undirected maximum traveling salesman problem (Max TSP) was presented. The expected performance guarantee of the algorithm approached 7/8 as n approached infinity, where n indicates the number of vertices in the graph. The problem of computing a binary 2-matching of maximum weight was computed and the related theorems were proved. A review of the Serdyukov's algorithm and the algorithm of Kostochka and Serdyukov was also presented.
AB - A randomized approximation algorithm for the metric version of undirected maximum traveling salesman problem (Max TSP) was presented. The expected performance guarantee of the algorithm approached 7/8 as n approached infinity, where n indicates the number of vertices in the graph. The problem of computing a binary 2-matching of maximum weight was computed and the related theorems were proved. A review of the Serdyukov's algorithm and the algorithm of Kostochka and Serdyukov was also presented.
KW - Analysis of algorithms
KW - Maximum traveling salesman problem
UR - http://www.scopus.com/inward/record.url?scp=0037117175&partnerID=8YFLogxK
U2 - 10.1016/S0020-0190(01)00234-4
DO - 10.1016/S0020-0190(01)00234-4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0037117175
SN - 0020-0190
VL - 81
SP - 247
EP - 251
JO - Information Processing Letters
JF - Information Processing Letters
IS - 5
ER -