22 citations · 40 across the 28 of their papers we have counts for
49 papers
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines
Sebastian Berndt, Hauke Brinkop, Klaus Jansen +2
Mixed-integer linear programming (MILP) is at the core of many advanced algorithms for solving fundamental problems in combinatorial optimization. The complexity of solving MILPs d…
Improved Algorithms for Monotone Moldable Job Scheduling using Compression and Convolution
Kilian Grage, Klaus Jansen, Felix Ohnesorge
In the moldable job scheduling problem one has to assign a set of jobs to machines, in order to minimize the time it takes to process all jobs. Each job is moldable, so it…
Scheduling with Many Shared Resources
Max A. Deppert, Klaus Jansen, Marten Maack +2
Consider the many shared resource scheduling problem where jobs have to be scheduled on identical parallel machines with the goal of minimizing the makespan. However, each job need…
The Power of Duality: Response Time Analysis meets Integer Programming
Max A. Deppert, Klaus Jansen
We study a mutually enriching connection between response time analysis in real-time systems and the mixing set problem. Thereby generalizing over known results we present a new ap…
Structural Results for High-Multiplicity Scheduling on Uniform Machines
Hauke Brinkop, David Fischer, Klaus Jansen
Parameterizing by the largest processing time and the number of different job processing times , we propose a proximity technique for High-Multiplicity Scheduling on U…
A PTAS for Packing Hypercubes into a Knapsack
Klaus Jansen, Arindam Khan, Marvin Lira +1
We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hyp…