3 papers
cs.DS2025
Faster Approximation Algorithms for k-Center via Data Reduction
Arnold Filtser, Shaofeng H. -C. Jiang, Yi Li +4
We study efficient algorithms for the Euclidean -Center problem, focusing on the regime of large . We take the approach of data reduction by considering -coreset, which i…
cs.DB2025
Quantum Data Sketches
Qin Zhang, Mohsen Heidari
Recent advancements in quantum technologies, particularly in quantum sensing and simulation, have facilitated the generation and analysis of inherently quantum data. This progress…
cs.LG2024
Computing Approximate Graph Edit Distance via Optimal Transport
Qihao Cheng, Da Yan, Tianhao Wu +2
Given a graph pair , graph edit distance (GED) is defined as the minimum number of edit operations converting to . GED is a fundamental operation widely used…