Sciweavers

3 search results - page 1 / 1
» Finding the Exact Integrality Gap for Small Traveling Salesm...
Sort
View
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 2 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 ...
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 9 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...