11 citations · 21 across the 13 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
cs.DS2020
Consistent k-Clustering for General Metrics
Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard +1
Given a stream of points in a metric space, is it possible to maintain a constant approximate clustering by changing the cluster centers only a small number of times during the ent…
cs.DS2020★ 4 cited
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time
Hendrik Fichtenberger, Mingze Gao, Pan Peng
We present a simple sublinear-time algorithm for sampling an arbitrary subgraph \emph{exactly uniformly} from a graph with edges, to which the algorithm has access by p…