Sciweavers

4377 search results - page 44 / 876
» Mass problems and randomness
Sort
View
SODA
2010
ACM
186views Algorithms» more  SODA 2010»
14 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...
ICALP
2010
Springer
14 years 7 months ago
Metrical Task Systems and the k-Server Problem on HSTs
Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
Nikhil Bansal, Niv Buchbinder, Joseph Naor
SODA
2010
ACM
168views Algorithms» more  SODA 2010»
15 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...
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 1 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga
P2P
2006
IEEE
153views Communications» more  P2P 2006»
15 years 3 months ago
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment,...
Anwitaman Datta, Karl Aberer