Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SODA

2010

ACM

2010

ACM

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 nodes s and t, both problems ask to find an s-t path visiting all other nodes. In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total cost of this path. In the directed latency problem, the objective is to minimize the sum of distances on this path from s to each node. Both of these problems are NP-hard. The best known approximation algorithms for ATSPP had ratio O(log n) [7,9] until the very recent result that improves it to O(log n/ log log n) [3,9]. However, only a bound of O( n) for the integrality gap of its linear programming relaxation has been known. For directed latency, the best previously known approximation algorithm has a guarantee of O(n1/2+ ), for any constant > 0 [23]. We present a new algorithm for the ATSPP problem that has approximation ratio of O...

Related Content

Added |
01 Mar 2010 |

Updated |
02 Mar 2010 |

Type |
Conference |

Year |
2010 |

Where |
SODA |

Authors |
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina |

Comments (0)