Fast greedy algorithms in mapreduce and streaming

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2013, Pages 1-10

  Kumar, Ravi ^a,b,c   Moseley, Benjamin ^a,b,c   Vassilvitskii, Sergei ^a,b,c   Vattani, Andrea ^a,b,c  

^a GOOGLE INC   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

GREEDY ALGORITHMS; MAP-REDUCE; MAXIMUM COVERS; PARALLELIZATIONS; PROCESSING POWER; SAMPLING TECHNIQUE; SEQUENTIAL ALGORITHM; SUBMODULAR;

APPROXIMATION ALGORITHMS;

EID: 84883512922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2486159.2486168     Document Type: Conference Paper

References (38)

1. R. Agrawal, S. Gollapudi, A. Halverson, and S. Ieong. Diversifying search results. In WSDM, pages 5-14, 2009.
2. A. Arasu, S. Chaudhuri, and R. Kaushik. Learning string transformations from examples. PVLDB, 2(l):514-525, 2009.
3. M. Babaioff, N. Immorlica, and R. Kleinberg. Matroids, secretary problems, and online mechanisms. In SODA, pages 434-143, 2007.
4. B. Bahmani, R. Kumar, and S. Vassilvitskii. Densest subgraph in streaming and MapReduce. PVLDB, 5(1), 2012.
5. M. Bateni, M. Hajiaghayi, and M. Zadimoghaddam. Submodular secretary problem and extensions. In APPROX-RANDOM, 2010.
6. Berger, rompel, and shor. efficient nc algorithms for set cover with applications to learning and geometry. JCSS, 49:454-477, 1994.
7. G. E. Blelloch, R. Peng, and K. Tangwongsan. Linear-work greedy parallel approximate set cover and variants. SPAA, pages 23-32, 2011.
8. G. Calinescu, C. Chekuri, M. Pal, and J. Vondrak. Maximizing a submodular set function subject to a matroid constraint. SICOMP, To appear
9. G. Capannini, F. M. Nardini, R. Perego, and F. Silvestri. Efficient diversification of web search results. PVLDB, 4(7):451-459, 2011.
10. M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In APPROX, pages 84-95, 2000.
11. W. Chen, C. Wang, and Y. Wang. Scalable inïňĆuence maximization for prevalent viral marketing in large-scale social networks. In KDD, pages 1029-1038, 2010.
12. W Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD, pages 199-208, 2009.
13. F. Chierichetti, R. Kumar, and A. Tomkins. Max-cover in Map-reduce. In WWW, pages 231-240, 2010.
14. G. Cormode, H. J. Karloff, and A. Wirth. Set cover algorithms for very large datasets. In CIKM, pages 479-488, 2010.
15. B. C. Dean, M. X. Goemans, and J. Vondrák. Adaptivity and approximation for stochastic packing problems. In SODA, pages 395-404, 2005.
16. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, page 10, 2004.
17. J. Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1:126-136, 1971.
18. A. Ene, S. Im, and B. Moseley. Fast clustering using MapReduce. In KDD, pages 85-94, 2011.
19. U. Feige. A threshold of Inn for approximating set cover. JACM, 45(4):634-652, 1998. (Pubitemid 128488790)
20. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of approximation for maximizing submodular set functions II Math. Prog. Study, 8:73-87, 1978.
21. A. Goel, S. Guha, and K. Munagala. Asking the right questions: model-driven optimization using probes. In PODS, pages 203-212, 2006.
22. M. T. Goodrich, N. Sitchinava, and Q. Zhang. Sorting, searching, and simulation in the MapReduce framework. In ISAAC, pages 374-383, 2011.
23. A. Goyal, F. Bonchi, and L. V. S. Lakshmana. A data-based approach to social influence maximization. PVLDB, 5(1), 2012.
24. A. Gupta, A. Roth, G. Schoenebeck, and K. Talwar. Constrained non-monotone submodular maximization: Offline and secretary algorithms. In WINE, pages 246-257, 2010.
25. E. Hazan, S. Safra, and O. Schwartz. On the complexity of approximating k-set packing. Computational Complexity, 15(1):20-39, 2006. (Pubitemid 43706824)
26. T. A. Jenkyns. The efficacy of the "greedy" algorithm. In Proceedings of 7th South Eastern Conference on Combinatorics, Graph Theory and Computing, pages 341-350, 1976.
27. H. J. Karloff, S. Suri, and S. Vassilvitskii. A model of computation for MapReduce. In SODA, pages 938-948, 2010.
28. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, 137-146, 2003.
29. B. Korte and D. Hausmann. An analysis of the greedy heuristic for independence systems. Annals of Discrete Math., 2:65-74, 1978.
30. S. Lattanzi, B. Moseley, S. Suri, and S. Vassilvitskii. Filtering: a method for solving graph problems in MapReduce. In SPAA, pages 85-94, 2011.
31. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD, pages 420-429, 2007.
32. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2005.
33. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximation for maximizing submodular set functions I. Math. Prog., 14:265-294, 1978.
34. A. Pietracaprina, G. Pucci, M. Riondato, F. Silvestri, and E. Upfal. Space-round tradeoffs for mapreduce computations. CoRR, abs/1111.2228, 2011.
35. B. Saha and L. Getoor. On maximum coverage in the streaming model & application to multi-topic blog-watch. In SDM, pages 697-708, 2009.
36. A. D. Sarma, A. Lall, D. Nanongkai, R. J. Lipton, and J. J. Xu. Representative skylines using threshold-based preference distributions. In ICDE, pages 387-398, 2011.
37. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8): 103-111, 1990.
38. J. Vondrak. Submodularity in Combinatorial Optimization PhD thesis, Charles University, Prague, 2007.