Publications (28)
A Faster FPTAS for the Unbounded Knapsack Problem
Klaus Jansen, Stefan Erich Julius Kraft
Closing the Gap for Makespan Scheduling via Sparsification Techniques
Klaus Jansen, Kim-Manuel Klein, José Verschae
Robust Online Algorithms for Dynamic Problems
Sebastian Berndt, Valentin Dreismann, Kilian Grage +2
Scheduling on (Un-)Related Machines with Setup Times
Klaus Jansen, Marten Maack, Alexander Mäcker
Fully Dynamic Bin Packing Revisited
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
Scheduling Monotone Moldable Jobs in Linear Time
Klaus Jansen, Felix Land
Near-Linear Time Algorithm for n-fold ILPs via Color Coding
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times
Max A. Deppert, Klaus Jansen
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
Klaus Jansen, Malin Rau
Structural Parameters for Scheduling with Assignment Restrictions
Klaus Jansen, Marten Maack, Roberto Solis-Oba
Empowering the Configuration-IP $-$ New PTAS Results for Scheduling with Setups Times
Klaus Jansen, Kim-Manuel Klein, Marten Maack +1
An EPTAS for machine scheduling with bag-constraints
Kilian Grage, Klaus Jansen, Kim Manuel Klein
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
Klaus Jansen, Marten Maack
On the optimality of approximation schemes for the classical scheduling problem
Lin Chen, Klaus Jansen, Guochuan Zhang
A Robust AFPTAS for Online Bin Packing with Polynomial Migration
Klaus Jansen, Kim-Manuel Klein
Trimming of Graphs, with Application to Point Labeling
Thomas Erlebach, Torben Hagerup, Klaus Jansen +2
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Sören Henning, Klaus Jansen, Malin Rau +1
About the Structure of the Integer Cone and its Application to Bin Packing
Klaus Jansen, Kim-Manuel Klein
A note on the integrality gap of the configuration LP for restricted Santa Claus
Klaus Jansen, Lars Rohwedder
Online Bin Covering with Limited Migration
Sebastian Berndt, Leah Epstein, Klaus Jansen +3
Algorithmic Aspects of Upper Domination
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel +6
Approximation results for makespan minimization with budgeted uncertainty
Marin Bougeret, Klaus Jansen, Michael Poss +1
Improved approximation for two dimensional strip packing with polynomial bounded width
Klaus Jansen, Malin Rau
Closing the gap for pseudo-polynomial strip packing
Klaus Jansen, Malin Rau
On the Configuration-LP of the Restricted Assignment Problem
Klaus Jansen, Lars Rohwedder
Local search breaks 1.75 for Graph Balancing
Klaus Jansen, Lars Rohwedder
Inapproximability Results for Scheduling with Interval and Resource Restrictions
Marten Maack, Klaus Jansen
Online Strip Packing with Polynomial Migration
Klaus Jansen, Kim-Manuel Klein, Maria Kosche +1