Linear-work greedy parallel approximate set cover and variants

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 23-32

  Blelloch, Guy E ^a   Peng, Richard ^a   Tangwongsan, Kanat ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

approximation algorithms; facility location; max cover; parallel algorithms; set cover

Indexed keywords

FACILITY LOCATION; FACILITY LOCATIONS; GRAPH PROBLEMS; GREEDY APPROXIMATION ALGORITHMS; INDEPENDENT SET; K-CENTER; KEY COMPONENT; LINEAR WORKS; MAX COVER; MIN-SUM; RANDOMIZED ALGORITHMS; SET COVER;

LOCATION;

APPROXIMATION ALGORITHMS;

EID: 79959660870     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989497     Document Type: Conference Paper

References (22)

1. Guy E. Blelloch and Bruce M. Maggs. Handbook of Algorithms and Theory of Computation, chapter Parallel Algorithms. CRC Press, Boca Raton, FL, 1998.
2. Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, and Tami Tamir. On chromatic sums and distributed resource allocation. Inform. and Comput., 140(2):183-202, 1998.
3. Bonnie Berger, John Rompel, and Peter W. Shor. Efficient NC algorithms for set cover with applications to learning and geometry. J. Comput. Syst. Sci., 49(3):454-477, 1994.
4. Guy E. Blelloch and Kanat Tangwongsan. Parallel approximation algorithms for facility-location problems. In SPAA, pages 315-324, 2010.
5. Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, and Joseph Naor. Asymmetric k-center is log* n-hard to approximate. J. ACM, 52(4):538-551, 2005.
6. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):pp. 233-235, 1979.
7. Flavio Chierichetti, Ravi Kumar, and Andrew Tomkins. Max-cover in map-reduce. In WWW, pages 231-240, 2010.
8. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, 1998.
9. Uriel Feige, László Lovász, and Prasad Tetali. Approximating min sum set cover. Algorithmica, 40(4):219-234, 2004.
10. Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci., 38(2-3):293-306, 1985.
11. Dorit S. Hochbaum and David B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10(2):180-184, 1985.
12. Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, and Vijay V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM, 50(6):795-824, 2003.
13. David S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. System Sci., 9:256-278, 1974.
14. R. M. Karp. Reducibility Among Combinatorial Problems. In R. E.Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
15. Samir Khuller, Uzi Vishkin, and Neal E. Young. A primal-dual parallel approximation technique applied to weighted set and vertex covers. J. Algorithms, 17(2):280-289, 1994.
16. Richard M. Karp and Avi Wigderson. A fast parallel algorithm for the maximal independent set problem. Journal of the ACM, 32(4):762-773, 1985. (Pubitemid 15580706) (Pubitemid 15580706)
17. Michael Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986. (Pubitemid 17465853) (Pubitemid 17465853)
18. Rina Panigrahy and Sundar Vishwanathan. An O(log* n) approximation algorithm for the asymmetric p-center problem. J. Algorithms, 27(2):259-268, 1998.
19. Sanguthevar Rajasekaran and John H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput., 18(3):594-607, 1989.
20. Sridhar Rajagopalan and Vijay V. Vazirani. Primaldual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput., 28(2):525-540, 1998.
21. Vijay V. Vazirani. Approximation algorithms. Springer-Verlag, Berlin, 2001.
22. Neal E. Young. Randomized rounding without solving the linear program. In SODA, pages 170-178, 1995.