4 papers
Streaming Max-Cut in General Metrics
Shaofeng H. -C. Jiang, Pan Peng, Haoze Wang
Max-Cut is a fundamental combinatorial optimization problem that has been studied in various computational settings. We initiate the study of its streaming complexity in \emph{gene…
Round-efficient Fully-scalable MPC algorithms for k-Means
Shaofeng H. -C. Jiang, Yaonan Jin, Jianing Lou +1
We study Euclidean -Means under the Massively Parallel Computation (MPC) model, focusing on the \emph{fully-scalable} setting. Our main result is a fully-scalable $O((\log n/\lo…
Tree Embedding in High Dimensions: Dynamic and Massively Parallel
Gramoz Goranci, Shaofeng H. -C. Jiang, Peter Kiss +3
Tree embedding has been a fundamental method in algorithm design with wide applications. We focus on the efficiency of building tree embedding in various computational settings und…
Fully Dynamic Algorithms for Chamfer Distance
Gramoz Goranci, Shaofeng Jiang, Peter Kiss +2
We study the problem of computing Chamfer distance in the fully dynamic setting, where two set of points , each of size up to , dynamically evolve t…