8 citations · 8 across the 1 of their papers we have counts for
2 papers
cs.DS2020
Sliding Window Algorithms for k-Clustering Problems
Michele Borassi, Alessandro Epasto, Silvio Lattanzi +2
The sliding window model of computation captures scenarios in which data is arriving continuously, but only the latest elements should be used for analysis. The goal is to desi…
cs.DS2015★ 8 cited
Fast and Simple Computation of Top-k Closeness Centralities
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respe…