Max-cover in map-reduce

Proceedings of the 19th International Conference on World Wide Web, WWW '10

Volumn , Issue , 2010, Pages 231-240

  Chierichetti, Flavio ^a   Kumar, Ravi ^b   Tomkins, Andrew ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YAHOO RESEARCH   (United States)

^c GOOGLE INC   (United States)

Author keywords

greedy algorithm; map reduce; maximum cover

Indexed keywords

COMMODITY CLUSTERS; COVER PROBLEM; GREEDY ALGORITHM; GREEDY ALGORITHMS; LARGE DATASETS; NP-HARD; PROBLEM INSTANCES; PROGRAMMING PARADIGMS; WEB SEARCHES;

APPROXIMATION ALGORITHMS; WORLD WIDE WEB;

CLUSTERING ALGORITHMS;

EID: 77954654780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1772690.1772715     Document Type: Conference Paper

References (36)

1. N. Alon, D. Moshkovitz, and S. Safra. Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms, 2(2):153-177, 2006.
2. B. Berger, J. Rompel, and P. W. Shor. Efficient NC algorithms for set cover with applications to learning and geometry. J. Comput. Syst. Sci., 49(3):454-477, 1994.
3. T. Brants, A. C. Popat, P. Xu, F. J. Och, and J. Dean. Large language models in machine translation. In Proc. EMNLP, pages 858-867, 2007.
4. M. Charikar. Greedy approximations for finding dense components in a graph. In Proc. 3rd APPROX, pages 84-95, 2000.
5. W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In Proc. 15th KDD, pages 199-208, 2009.
6. C. T. Chu, S. K. Kim, Y. A. Lin, Y. Yu, G. R. Bradski, A. Y. Ng, and K. Olukotun. Map-reduce for machine learning on multicore. In Proc. NIPS, pages 281-288, 2006.
7. J. Cohen. Graph twiddling in a MapReduce world. Computing in Science and Engineering, 11(4):29-41, 2009.
8. A. Dasgupta, A. Ghosh, R. Kumar, C. Olston, S. Pandey, and A. Tomkins. The discoverability of the web. In Proc. 16th WWW, pages 421-430, 2007.
9. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. C. ACM, 51:107-113, 2008.
10. J. Ekanayake, S. Pallickara, and G. Fox. MapReduce for data intensive scientific analyses. In IEEE Fourth International Conference on eScience, pages 277-284, 2008.
11. T. Elsayed, J. Lin, and D. W. Oard. Pairwise document similarity in large collections with MapReduce. In Proc. 46th ACL/HLT, pages 265-268, 2008.
12. U. Feige. A threshold of ln n for approximationg set cover. J. ACM, 45:634-652, 1988.
13. J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina. On distributing symmetric streaming computations. In Proc. 19th SODA, pages 710-719, 2008.
14. R. Gandhi, S. Khuller, and A. Srinivasan. Approximation algorithms for partial covering problems. Journal of Algorithms, 2(1):55-84, 2004.
15. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979.
16. D. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. Course Technology, July 1996.
17. D. Hochbaum and A. Pathria. Analysis of the greedy approach in covering problems, 1994. Unpublished manuscript.
18. U. Kang, C. E. Tsourakakis, A. Appel, C. Faloutsos, and J. Leskovec. HADI: Fast diameter estimation and mining in massive graphs with Hadoop. Technical Report CMU-ML-08-117, CMU, 2008.
19. H. Karloff, S. Suri, and S. Vassilvitskii. A model of computation for MapReduce. In Proc. 20th SODA, 2010.
20. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of inuence through a social network. In Proc. 9th KDD, pages 137-146, 2003.
21. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Information Processing Letters, 70(1):39-45, 1999.
22. A. Kimball. Parallel graph algorithms with MapReduce. http://youtube.com/watch?v=BT-piFBP4fE.
23. R. Kumar, A. Tomkins, and E. Vee. Connectivity structure of bipartite graphs via the KNC-plot. In Proc. 1st WSDM, pages 129-138, 2008.
24. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In Proc. 13th KDD, pages 420-429, 2007.
25. J. Lin. Exploring large-data issues in the curriculum: A case study with MapReduce. In 3rd Workshop on Issues in Teaching Computational Linguistics (TeachCL-08) at ACL, pages 54-61, 2008.
26. J. Lin and C. Dyer. Text processing with MapReduce, 2009. NAACL/HLT Tutorial, http://www.umiacs.umd.edu/~jimmylin/ cloud-computing/NAACL-HLT-2009/ index.html.
27. J. J. Lin. Scalable language processing algorithms for the masses: A case study in computing word co-occurrence matrices with MapReduce. In Proc. EMNLP, pages 419-428, 2008.
28. R. M. C. McCreadie, C. Macdonald, and I. Ounis. On single-pass indexing with MapReduce. In Proc. 32nd SIGIR, pages 742-743, 2009.
29. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2005.
30. S. Muthukrishnan. MapReduce again, 2008. http://mysliceofpizza.blogspot. com/2008/01/ mapreduce-again.html.
31. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web, 1999.
32. S. Papadimitriou and J. Sun. Disco: Distributed co-clustering with Map-Reduce: A case study towards petabyte-scale end-to-end mining. In Proc. of 8th ICDM, pages 512-521, 2008.
33. D. Rao and D. Yarowsky. Ranking and semi-supervised classification on large scale graphs using Map-Reduce. In Proc. 4th TextGraphs at ACL/IJCNLP, 2009.
34. B. Saha and L. Getoor. On maximum coverage in the streaming model & application to multi-topic blog-watch. In Proc. 9th SDM, pages 697-708, 2008.
35. C. E. Tsourakakis. Fast counting of triangles in large real networks without counting: Algorithms and laws. In Proc. 8th ICDM, pages 608-617, 2008.
36. C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos. DOULION: Counting triangles in massive graphs with a coin. In Proc. 15th KDD, pages 837-846, 2009.