6 citations · 14 across the 15 of their papers we have counts for
Showing 2022 · cs.DSShow all
3 papers · 2 filters
cs.DS2022
Streaming Euclidean Max-Cut: Dimension vs Data Reduction
Xiaoyu Chen, Shaofeng H. -C. Jiang, Robert Krauthgamer
Max-Cut is a fundamental problem that has been studied extensively in various settings. We design an algorithm for Euclidean Max-Cut, where the input is a set of points in $\mathbb…
cs.DS2022★ 1 cited
Near-optimal Coresets for Robust Clustering
Lingxiao Huang, Shaofeng H. -C. Jiang, Jianing Lou +1
We consider robust clustering problems in , specifically -clustering problems (e.g., -Median and -Means with outliers, where the cost for a given center…
cs.DS2022
Streaming Facility Location in High Dimension via Geometric Hashing
Artur Czumaj, Arnold Filtser, Shaofeng H. -C. Jiang +3
In Euclidean Uniform Facility Location (UFL), the input is a set of clients in and the goal is to place facilities to serve them, so as to minimize the total cost of…