2 citations · 9 across the 10 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Fair Center Clustering in Sliding Windows
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci +1
The -center problem requires the selection of points (centers) from a given metric pointset so to minimize the maximum distance of any point of from the closest cent…
cs.DS2016★ 2 cited
Clustering Uncertain Graphs
Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina +2
An uncertain graph can be viewed as a probability space whose outcomes (referred to as \emph{possible worlds}) are subgraphs of $\ma…