Sciweavers

TOC
2008
95views more  TOC 2008»
14 years 2 months ago
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 12 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...