An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

2006 ◽  
pp. 95-103 ◽  
Author(s):  
Chandra Chekuri ◽  
Martin Pál
Keyword(s):  
Approximation Ratio ◽  
Traveling Salesman ◽  
Traveling Salesman Path

scholarly journals Traveling salesman path problems

2006 ◽  
Vol 113 (1) ◽  
pp. 39-59 ◽  
Author(s):  
Fumei Lam ◽  
Alantha Newman
Keyword(s):  
Traveling Salesman ◽  
Traveling Salesman Path

scholarly journals The asymmetric traveling salesman path LP has constant integrality ratio

2019 ◽  
Vol 183 (1-2) ◽  
pp. 379-395 ◽  
Author(s):  
Anna Köhne ◽  
Vera Traub ◽  
Jens Vygen
Keyword(s):  
Traveling Salesman ◽  
Traveling Salesman Path

scholarly journals New Bounds for the Traveling Salesman Constant

2015 ◽  
Vol 47 (01) ◽  
pp. 27-36 ◽  
Author(s):  
Stefan Steinerberger
Keyword(s):  
Lower Bounds ◽  
Random Variables ◽  
Universal Constant ◽  
Traveling Salesman ◽  
Upper And Lower Bounds ◽  
Unit Square ◽  
Traveling Salesman Path

Let X 1, X 2, …, X n be independent and uniformly distributed random variables in the unit square [0, 1]2, and let L(X 1, …, X n ) be the length of the shortest traveling salesman path through these points. In 1959, Beardwood, Halton and Hammersley proved the existence of a universal constant β such that lim n→∞ n −1/2 L(X 1, …, X n ) = β almost surely. The best bounds for β are still those originally established by Beardwood, Halton and Hammersley, namely 0.625 ≤ β ≤ 0.922. We slightly improve both upper and lower bounds.

An Approximation Algorithm for a Heterogeneous Traveling Salesman Problem

2011 ◽  
Author(s):  
Jungyun Bae ◽  
Sivakumar Rathinam
Keyword(s):  
Approximation Algorithm ◽  
Traveling Salesman Problem ◽  
Approximation Ratio ◽  
Traveling Salesman ◽  
Dual Algorithm ◽  
Routing Problem ◽  
Primal Dual ◽  
Surveillance Applications

Surveillance applications require a collection of heterogeneous vehicles to visit a set of targets. In this article, we consider a fundamental routing problem that arises in these applications involving two vehicles. Specifically, we consider a routing problem where there are two heterogeneous vehicles that start from distinct initial locations, and a set of targets. The objective is to find a tour for each vehicle such that each of the targets is visited at least once by a vehicle and the sum of the distances traveled by the vehicles is a minimum. We present a novel primal-dual algorithm for the same that provides an approximation ratio of 2.

scholarly journals Asymmetric Traveling Salesman Path and Directed Latency Problems

2013 ◽  
Vol 42 (4) ◽  
pp. 1596-1619 ◽  
Author(s):  
Zachary Friggstad ◽  
Mohammad R. Salavatipour ◽  
Zoya Svitkina
Keyword(s):  
Traveling Salesman ◽  
Traveling Salesman Path
Sign in / Sign up

Export Citation Format

Share Document