2 citations · 2 across the 3 of their papers we have counts for
3 papers
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
Diversity maximization is a fundamental problem in web search and data mining. For a given dataset of elements, the problem requires to determine a subset of containing…
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce
Matteo Ceccarello, Francesco Silvestri
A common approach in the design of MapReduce algorithms is to minimize the number of rounds. Indeed, there are many examples in the literature of monolithic MapReduce algorithms, w…
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci +1
We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected fr…