Randomized Composable Coresets for Matching and Vertex Cover
Randomized Composable Coresets for Matching and Vertex Cover
A common approach for designing scalable algorithms for massive data sets is to distribute the computation across, say k, machines and process the data using limited communication between them. A particularly appealing framework here is the simultaneous communication model whereby each machine constructs a small representative summary of its own …