1 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares
Klaus Jansen, Alexandra Lassota, Malte Tutas +1
We study the computational complexity of fairly allocating indivisible, mixed-manna items. For basic measures of fairness, this problem is hard in general. Thus, research has flour…
New Algorithm for Combinatorial -folds and Applications
Klaus Jansen, Kai Kahler, Lis Pirotton +1
Block-structured integer linear programs (ILPs) play an important role in various application fields. We address -fold ILPs where the matrix has a specific structu…
Exact and Approximate High-Multiplicity Scheduling on Identical Machines
Klaus Jansen, Kai Kahler, Esther Zwanger
Goemans and Rothvoss (SODA'14) gave a framework for solving problems which can be described as finding a point in intcone, where $P,Q\subset\mathbb{R}…
Hardness and Tight Approximations of Demand Strip Packing
Klaus Jansen, Malin Rau, Malte Tutas
We settle the pseudo-polynomial complexity of the Demand Strip Packing (DSP) problem: Given a strip of fixed width and a set of items with widths and heights, the items must be pla…