4 papers
Faster Exponential Algorithms for Multi-Machine Scheduling Problems
Anubhav Dhar, Anita Dürr, Ahmed Ghazy +2
Minimizing the weighted completion times () and weighted number of tardy jobs () on multiple identical machines are two classical NP-har…
Faster algorithms for k-Orthogonal Vectors in low dimension
Anita Dürr, Evangelos Kipouridis, Michael Lampis +1
In the Orthogonal Vectors problem (OV), we are given two families of subsets of , each of size , and the task is to decide whether there exists a pair $a…
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
Karl Bringmann, Anita Dürr, Adam Polak
We present a pseudopolynomial-time algorithm for the Knapsack problem that has running time , where is the number of items, is the knap…
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs
Anita Dürr, Nicolas El Maalouly, Lasse Wulf
In 1982 Papadimitriou and Yannakakis introduced the Exact Matching problem, in which given a red and blue edge-colored graph and an integer one has to decide whether there…