57 citations · 84 across the 20 of their papers we have counts for
3 papers · 1 filter
Coresets for Clustering in Graphs of Bounded Treewidth
Daniel Baker, Vladimir Braverman, Lingxiao Huang +3
We initiate the study of coresets for clustering in graph metrics, i.e., the shortest-path metric of edge-weighted graphs. Such clustering problems are essential to data analysis a…
Coresets for Clustering with Fairness Constraints
Lingxiao Huang, Shaofeng H. -C. Jiang, Nisheeth K. Vishnoi
In a recent work, [19] studied the following "fair" variants of classical clustering problems such as -means and -median: given a set of data points in and…
Coresets for Ordered Weighted Clustering
Vladimir Braverman, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
We design coresets for Ordered k-Median, a generalization of classical clustering problems such as k-Median and k-Center, that offers a more flexible data analysis, like easily com…