Parallel approximation algorithms for facility-location problems

This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-center, k-median, and k-means. These problems have received considerable attention during the past decades from the approximation algorithms community, which primarily concentrates on improving the approximation guarantees. In this paper, we ask: Is it possible to parallelize some of the beautiful results from the sequential setting? Our starting point is a small, but diverse, subset of results in approximation algorithms for facility-location problems, with a primary goal of developing techniques for devising their efficient parallel counterparts. We focus on giving algorithms with low depth, near work efficiency (compared to the sequential versions), and low cache complexity. Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms Algorithm...

• Type: Conference
• Year: 2010
• Where: SPAA
• Authors: Guy E. Blelloch, Kanat Tangwongsan
• Keywords: Approximation Algorithms, Approximation Algorithms Community, Distributed And Parallel Computing, Parallel Approximation Algorithms, SPAA 2010