Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-21T02:13:43.733Z Has data issue: false hasContentIssue false

9 - Asymmetric Path TSP

Published online by Cambridge University Press:  14 November 2024

Vera Traub
Affiliation:
University of Bonn
Jens Vygen
Affiliation:
University of Bonn
Get access

Summary

A natural generalization of the (asymmetric) traveling salesman problem arises when we are given a start vertex s and an end vertex t and ask for a tour that begins in s and ends in t, rather than a round trip.

While this problem seems to be harder, we will see in this chapter that it can be tackled by similar techniques. In particular, we show black-box reductions (by Feige and Singh, and by Köhne, Traub, and Vygen) to Asymmetric TSP and prove, as new results, the best-known approximation ratios and bounds on the integrality ratio of the natural LP relaxation.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2024

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Asymmetric Path TSP
  • Vera Traub, University of Bonn, Jens Vygen, University of Bonn
  • Book: Approximation Algorithms for Traveling Salesman Problems
  • Online publication: 14 November 2024
  • Chapter DOI: https://doi.org/10.1017/9781009445436.010
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Asymmetric Path TSP
  • Vera Traub, University of Bonn, Jens Vygen, University of Bonn
  • Book: Approximation Algorithms for Traveling Salesman Problems
  • Online publication: 14 November 2024
  • Chapter DOI: https://doi.org/10.1017/9781009445436.010
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Asymmetric Path TSP
  • Vera Traub, University of Bonn, Jens Vygen, University of Bonn
  • Book: Approximation Algorithms for Traveling Salesman Problems
  • Online publication: 14 November 2024
  • Chapter DOI: https://doi.org/10.1017/9781009445436.010
Available formats
×