11 citations · 28 across the 13 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
Breaking the Barrier of 2 for the Storage Allocation Problem
Tobias Mömke, Andreas Wiese
Packing problems are an important class of optimization problems. The probably most well-known problem if this type is knapsack and many generalizations of it have been studied in…
cs.DS2019
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
The area of parameterized approximation seeks to combine approximation and parameterized algorithms to obtain, e.g., (1+eps)-approximations in f(k,eps)n^{O(1)} time where k is some…
cs.DS2019
On the extension complexity of scheduling
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
Linear programming is a powerful method in combinatorial optimization with many applications in theory and practice. For solving a linear program quickly it is desirable to have a…