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...
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
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...
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...
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,...