A 7/8 -approximation algorithm for metric max TSP

Refael Hassin, Shlomi Rubinstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAlgorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Roberto Tamassia
PublisherSpringer Verlag
Pages205-209
Number of pages5
ISBN (Print)3540424237, 9783540424239
DOIs
StatePublished - 2001
Event7th International Workshop on Algorithms and Data Structures, WADS 2001 - Providence, United States
Duration: 8 Aug 200110 Aug 2001

Publication series

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

Conference

Conference7th International Workshop on Algorithms and Data Structures, WADS 2001
Country/TerritoryUnited States
CityProvidence
Period8/08/0110/08/01

Fingerprint

Dive into the research topics of 'A 7/8 -approximation algorithm for metric max TSP'. Together they form a unique fingerprint.

Cite this