Parallel approximation algorithms for facility-location problems

, and . Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures, page 315--324. New York, NY, USA, ACM, (2010)


This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including <b>NC</b> and <b>RNC</b> algorithms for (metric) facility location, <i>k</i>-center, <i>k</i>-median, and <i>k</i>-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: <i>Is it possible to parallelize some of the beautiful results from the sequential setting?</i>.</p> <p>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.

Links and resources

BibTeX key:
search on:

Comments and Reviews  

There is no review or comment yet. You can write one!


Cite this publication