8 citations · 8 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…
cs.DS2022
Shortest Beer Path Queries in Interval Graphs
Rathish Das, Meng He, Eitan Kondratovsky +3
Our interest is in paths between pairs of vertices that go through at least one of a subset of the vertices known as beer vertices. Such a path is called a beer path, and the beer…