Sciweavers

140 search results - page 10 / 28
» soda 2010
Sort
View
SODA
2010
ACM
168views Algorithms» more  SODA 2010»
14 years 7 months ago
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
SODA
2010
ACM
186views Algorithms» more  SODA 2010»
13 years 8 months ago
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
HICSS
2010
IEEE
171views Biometrics» more  HICSS 2010»
14 years 2 months ago
Service Oriented Device Integration - An Analysis of SOA Design Patterns
Service oriented device architecture (SODA) is a promising approach for overcoming interoperability issues and especially for extending the IT support of business processes to dev...
Christian Mauro, Jan Marco Leimeister, Helmut Krcm...
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 8 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
14 years 7 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu