If you need an accessible version of this item please contact JSTOR User Support

The Traveling Salesman Problem with Distances One and Two

Christos H. Papadimitriou and Mihalis Yannakakis
Mathematics of Operations Research
Vol. 18, No. 1 (Feb., 1993), pp. 1-11
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3690150
Page Count: 11
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
The Traveling Salesman Problem with Distances One and Two
Preview not available

Abstract

We present a polynomial-time approximation algorithm with worst-case ratio 7/6 for the special case of the traveling salesman problem in which all distances are either one or two. We also show that this special case of the traveling salesman problem is MAX SNP-hard, and therefore it is unlikely that it has a polynomial-time approximation scheme.

Page Thumbnails

  • Thumbnail: Page 
1
    1
  • Thumbnail: Page 
2
    2
  • Thumbnail: Page 
3
    3
  • Thumbnail: Page 
4
    4
  • Thumbnail: Page 
5
    5
  • Thumbnail: Page 
6
    6
  • Thumbnail: Page 
7
    7
  • Thumbnail: Page 
8
    8
  • Thumbnail: Page 
9
    9
  • Thumbnail: Page 
10
    10
  • Thumbnail: Page 
11
    11