1 citations · 1 across the 5 of their papers we have counts for
5 papers
Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Bicriteria Optimality in 2D
Karl Bringmann, Ariel Kulik, Karol Węgrzycki
We revisit the -dimensional Vector Knapsack problem (-Knapsack): Given a -dimensional capacity vector and a set of items, each with a -dimensional weight vector and a p…
Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
Karl Bringmann, Nick Fischer, Yanheng Wang
The subgraph isomorphism problem and its generalizations, such as conjunctive queries where some nodes are projected, are among the most fundamental problems in graph algorithms an…
Lawler-Moore Speedups via Additive Combinatorics
Karl Bringmann, Danny Hermelin, Tomohiro Koana +1
The Lawler-Moore dynamic programming framework is a classical tool in scheduling on parallel machines. It applies when the objective is regular, i.e. monotone in job completion tim…
Fine-Grained Complexity of Continuous Euclidean k-Center
Lotte Blank, Karl Bringmann, Parinya Chalermsook +4
In the (continuous) Euclidean -center problem, given points in and an integer , the goal is to find center points in that minimize the m…
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…