A 7/8 -approximation algorithm for metric max TSP

Refael Hassin; Shlomi Rubinstein

doi:10.1007/3-540-44634-6_19

A 7/8 -approximation algorithm for metric max TSP

Refael Hassin, Shlomi Rubinstein

School of Mathematical Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present a randomized approximation algorithm for the metric undirected maximum traveling salesman problem. Its expected performance guarantee approaches (formula presented) as n → ∞, where n is the number of vertices in the graph.

Original language	English
Title of host publication	Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings
Editors	Frank Dehne, Jorg-Rudiger Sack, Roberto Tamassia
Publisher	Springer Verlag
Pages	205-209
Number of pages	5
ISBN (Print)	3540424237, 9783540424239
DOIs	https://doi.org/10.1007/3-540-44634-6_19
State	Published - 2001
Event	7th International Workshop on Algorithms and Data Structures, WADS 2001 - Providence, United States Duration: 8 Aug 2001 → 10 Aug 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2125
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Workshop on Algorithms and Data Structures, WADS 2001
Country/Territory	United States
City	Providence
Period	8/08/01 → 10/08/01

Access to Document

10.1007/3-540-44634-6_19

Cite this

Hassin, R., & Rubinstein, S. (2001). A 7/8 -approximation algorithm for metric max TSP. In F. Dehne, J-R. Sack, & R. Tamassia (Eds.), Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings (pp. 205-209). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2125). Springer Verlag. https://doi.org/10.1007/3-540-44634-6_19

Hassin, Refael ; Rubinstein, Shlomi. / A 7/8 -approximation algorithm for metric max TSP. Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. editor / Frank Dehne ; Jorg-Rudiger Sack ; Roberto Tamassia. Springer Verlag, 2001. pp. 205-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{dac72f574588487bb67650bbcf0d4e41,

title = "A 7/8 -approximation algorithm for metric max TSP",

abstract = "We present a randomized approximation algorithm for the metric undirected maximum traveling salesman problem. Its expected performance guarantee approaches (formula presented) as n → ∞, where n is the number of vertices in the graph.",

author = "Refael Hassin and Shlomi Rubinstein",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; null ; Conference date: 08-08-2001 Through 10-08-2001",

year = "2001",

doi = "10.1007/3-540-44634-6_19",

language = "אנגלית",

isbn = "3540424237",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "205--209",

editor = "Frank Dehne and Jorg-Rudiger Sack and Roberto Tamassia",

booktitle = "Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings",

}

Hassin, R & Rubinstein, S 2001, A 7/8 -approximation algorithm for metric max TSP. in F Dehne, J-R Sack & R Tamassia (eds), Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2125, Springer Verlag, pp. 205-209, 7th International Workshop on Algorithms and Data Structures, WADS 2001, Providence, United States, 8/08/01. https://doi.org/10.1007/3-540-44634-6_19

A 7/8 -approximation algorithm for metric max TSP. / Hassin, Refael; Rubinstein, Shlomi.

Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. ed. / Frank Dehne; Jorg-Rudiger Sack; Roberto Tamassia. Springer Verlag, 2001. p. 205-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2125).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A 7/8 -approximation algorithm for metric max TSP

AU - Hassin, Refael

AU - Rubinstein, Shlomi

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - We present a randomized approximation algorithm for the metric undirected maximum traveling salesman problem. Its expected performance guarantee approaches (formula presented) as n → ∞, where n is the number of vertices in the graph.

AB - We present a randomized approximation algorithm for the metric undirected maximum traveling salesman problem. Its expected performance guarantee approaches (formula presented) as n → ∞, where n is the number of vertices in the graph.

UR - http://www.scopus.com/inward/record.url?scp=0348089623&partnerID=8YFLogxK

U2 - 10.1007/3-540-44634-6_19

DO - 10.1007/3-540-44634-6_19

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0348089623

SN - 3540424237

SN - 9783540424239

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

SP - 205

EP - 209

BT - Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Tamassia, Roberto

PB - Springer Verlag

Y2 - 8 August 2001 through 10 August 2001

ER -

Hassin R, Rubinstein S. A 7/8 -approximation algorithm for metric max TSP. In Dehne F, Sack J-R, Tamassia R, editors, Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Springer Verlag. 2001. p. 205-209. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-44634-6_19

A 7/8 -approximation algorithm for metric max TSP

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this