8 citations · 8 across the 6 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.CG2025
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
Jack Spalding-Jamieson, Anurag Murty Naredla
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimu…
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 is…