Karl Bringmann

most citedFine-Grained Complexity of Continuous Euclidean k-Center

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2026★ 1 cited

Fine-Grained Complexity of Continuous Euclidean k-Center

Lotte Blank, Karl Bringmann, Parinya Chalermsook +4

In the (continuous) Euclidean $k$ -center problem, given $n$ points in $R^{d}$ and an integer $k$ , the goal is to find $k$ center points in $R^{d}$ that minimize the m…

cs.CG2024

Fine-Grained Complexity of Earth Mover's Distance under Translation

Karl Bringmann, Frank Staals, Karol Węgrzycki +1

The Earth Mover's Distance is a popular similarity measure in several branches of computer science. It measures the minimum total edge length of a perfect matching between two poin…