Greedy and Local Ratio Algorithms in the MapReduce Model

MapReduce has become the de facto standard model for designing distributed algorithms to process big data on a cluster. There has been considerable research on designing efficient MapReduce algorithms for clustering, graph optimization, and submodular optimization problems. We develop new techniques for designing greedy and local ratio algorithms in this setting. Our randomized local ratio technique gives $2$-approximations for weighted vertex cover and weighted matching, and an $f$-approximation for weighted set cover, all in a constant number of MapReduce rounds. Our randomized greedy technique gives algorithms for maximal independent set, maximal clique, and a $(1+\epsilon)\ln \Delta$-approximation for weighted set cover. We also give greedy algorithms for vertex colouring with $(1+o(1))\Delta$ colours and edge colouring with $(1+o(1))\Delta$ colours.