Better approximations for max TSP

Refael Hassin; Shlomi Rubinstein

doi:10.1016/S0020-0190(00)00097-1

Better approximations for max TSP

Refael Hassin
, Shlomi Rubinstein

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

51 Scopus citations

Abstract

Two known polynomial time approximation algorithms for the maximum traveling salesman problem (TSP) are combined to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r<25/33. Serdyukov's algorithm is first describe and then combine the polynomial time approximation. The results are then applied to obtain new approximation results for the maximum latency TSP.

Original language	English
Pages (from-to)	181-186
Number of pages	6
Journal	Information Processing Letters
Volume	75
Issue number	4
DOIs	https://doi.org/10.1016/S0020-0190(00)00097-1
State	Published - 30 Sep 2000

Access to Document

10.1016/S0020-0190(00)00097-1

Cite this

@article{5091b7a56999424fba897893eaacf2d8,

title = "Better approximations for max TSP",

abstract = "Two known polynomial time approximation algorithms for the maximum traveling salesman problem (TSP) are combined to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r<25/33. Serdyukov's algorithm is first describe and then combine the polynomial time approximation. The results are then applied to obtain new approximation results for the maximum latency TSP.",

author = "Refael Hassin and Shlomi Rubinstein",

year = "2000",

month = sep,

day = "30",

doi = "10.1016/S0020-0190(00)00097-1",

language = "אנגלית",

volume = "75",

pages = "181--186",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - Better approximations for max TSP

AU - Hassin, Refael

AU - Rubinstein, Shlomi

PY - 2000/9/30

Y1 - 2000/9/30

N2 - Two known polynomial time approximation algorithms for the maximum traveling salesman problem (TSP) are combined to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r<25/33. Serdyukov's algorithm is first describe and then combine the polynomial time approximation. The results are then applied to obtain new approximation results for the maximum latency TSP.

AB - Two known polynomial time approximation algorithms for the maximum traveling salesman problem (TSP) are combined to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r<25/33. Serdyukov's algorithm is first describe and then combine the polynomial time approximation. The results are then applied to obtain new approximation results for the maximum latency TSP.

UR - https://www.scopus.com/pages/publications/0034272886

U2 - 10.1016/S0020-0190(00)00097-1

DO - 10.1016/S0020-0190(00)00097-1

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0034272886

SN - 0020-0190

VL - 75

SP - 181

EP - 186

JO - Information Processing Letters

JF - Information Processing Letters

IS - 4

ER -

Better approximations for max TSP

Abstract

Access to Document

Other files and links

Fingerprint

Cite this