96 citations · 442 across the 64 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
A Fine-Grained Perspective on Approximating Subset Sum and Partition
Karl Bringmann, Vasileios Nakos
Approximating Subset Sum is a classic and fundamental problem in computer science and mathematical optimization. The state-of-the-art approximation scheme for Subset Sum computes a…
cs.DS2019★ 6 cited
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max
Karl Bringmann, Marvin Künnemann, Karol Węgrzycki
Zwick's -approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time , where i…
cs.CG2019
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
Karl Bringmann, Marvin Künnemann, André Nusser
The Fréchet distance provides a natural and intuitive measure for the popular task of computing the similarity of two (polygonal) curves. While a simple algorithm computes it in ne…