Fetching the paper…
Reading the bibliography…
MapReduce has become the de facto standard model for designing distributed algorithms to process big data on a cluster.
A greedy heuristic for the set covering problem
Vasek Chvatal · 1979
Earlier work this paper cites.
Parallel computation
Leslie G. Valiant · 1982
Earlier work this paper cites.
An analysis of the greedy algorithm for the submodular set covering problem
Laurence A. Wolsey · 1982
Earlier work this paper cites.
An overview of computational complexity
Stephen A. Cook · 1983
Earlier work this paper cites.
A local-ratio theorem for approximating the weighted vertex cover problem
Reuven Bar-Yehuda and Shimon Even · 1985
Earlier work this paper cites.
A simple parallel algorithm for the maximal independent set problem
Michael Luby · 1986
Earlier work this paper cites.
A bridging model for parallel computation
Leslie G. Valiant · 1990
Earlier work this paper cites.
A constructive proof of vizing’s theorem
J. Misra and David Gries · 1992
Earlier work this paper cites.
Removing randomness in parallel computation without a processor penalty
Michael Luby · 1993
Earlier work this paper cites.
Efficient nc algorithms for set cover with applications to learning and geometry
Bonnie Berger, John Rompel, and Peter W. Shor · 1994
Earlier work this paper cites.
Primal-dual rnc approximation algorithms for set cover and covering integer programs
Sridhar Rajagopalan and Vijay V. Vazirani · 1998
Earlier work this paper cites.
Approximation Algorithms
Vijay V. Vazirani · 2001
Earlier work this paper cites.
Local ratio: A unified framework for approximation algorithms in memoriam: Shimon Even 1935-2004
Reuven Bar-Yehuda, Keren Bendel, Ari Freund, and Dror Rawitz · 2004
Earlier work this paper cites.
Graphs over time: densification laws, shrinking diameters and possible explanations
Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos · 2005
Earlier work this paper cites.
Michael T. Goodrich · 2010
Cited alongside, same era.
A model of computation for MapReduce
Howard J. Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010
Cited alongside, same era.
Linear-work greedy parallel approximate set cover and variants
Guy E. Blelloch, Richard Peng, and Kanat Tangwongsan · 2011
Cited alongside, same era.
Sorting, searching, and simulation in the MapReduce framework
Michael T. Goodrich, Nodari Sitchinava, and Qin Zhang · 2011
Cited alongside, same era.
HADI: mining radii of large graphs
U. Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, and Jure Leskovec · 2011
Cited alongside, same era.
Filtering: a method for solving graph problems in MapReduce
Distributed submodular cover: Succinctly summarizing massive data
Baharan Mirzasoleiman, Amin Karbasi, Ashwinkumar Badanidiyuru, and Andreas Krause · 2015
Later among the works it cites.
Set cover at web scale
Stergios Stergiou and Kostas Tsioutsiouliklis · 2015
Later among the works it cites.
A new framework for distributed submodular maximization
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, and Justin Ward · 2016
Later among the works it cites.
Streaming weighted matchings: Optimal meets greedy
Elena Grigorescu, Morteza Monemizadeh, and Samson Zhou · 2016
Later among the works it cites.
Fast distributed submodular cover: Public-private data summarization
Baharan Mirzasoleiman, Morteza Zadimoghaddam, and Andreas Krause · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, and Sergei Vassilvitskii · 2011
Cited alongside, same era.
Communication steps for parallel query processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2013
Cited alongside, same era.
Improved streaming algorithms for weighted matching, via unweighted matching
Michael Crouch and Daniel S. Stubbs · 2014
Cited alongside, same era.
Composable core-sets for diversity and coverage maximization
Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, and Vahab S. Mirrokni · 2014
Cited alongside, same era.
Mining of Massive Datasets
Jure Leskovec, Anand Rajaraman, and Jeff Ullman · 2014
Cited alongside, same era.
Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints
Kook Jin Ahn and Sudipto Guha · 2015
Cited alongside, same era.
Fast greedy algorithms in MapReduce and streaming
Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, and Andrea Vattani · 2015
Cited alongside, same era.
Sepehr Assadi · 2017
Later among the works it cites.
Coresets meet edcs: Algorithms for matching and vertex cover on massive graphs
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab Mirrokni, and Cliff Stein · 2017
Later among the works it cites.
Randomized composable coresets for matching and vertex cover
Sepehr Assadi and Sanjeev Khanna · 2017
Later among the works it cites.
Distributed Graph Coloring
Leonid Barenboim and Michael Elkin · 2017
Later among the works it cites.
Round compression for parallel matching algorithms, 2017
Artur Czumaj, Jakub Łącki, Aleksander Mądry, Slobodan Mitrović, Krzysztof Onak, and Piotr Sankowski · 2017
Later among the works it cites.
Julienne: A framework for parallel graph algorithms using work-efficient bucketing
Laxman Dhulipala, Guy Blelloch, and Julian Shun · 2017
Later among the works it cites.
Space-optimal semi-streaming for
Mohsen Ghaffari · 2017
Later among the works it cites.
Efficient massively parallel methods for dynamic programming
Sungjin Im, Benjamin Moseley, and Xiaorui Sun · 2017
Later among the works it cites.