2 papers
cs.DS2021
Improved Analysis of Online Balanced Clustering
Marcin Bienkowski, Martin Böhm, Martin Koutecký +3
In the online balanced graph repartitioning problem, one has to maintain a clustering of nodes into clusters, each having nodes. During runtime, an online…
cs.DS2021
Theory meets Practice at the Median: a worst case comparison of relative error quantile algorithms
Graham Cormode, Abhinav Mishra, Joseph Ross +1
Estimating the distribution and quantiles of data is a foundational task in data mining and data science. We study algorithms which provide accurate results for extreme quantile qu…