Algorithms and Complexity Group

2017

Klaus Jansen and Stefan Kraft
A Faster FPTAS for the Unbounded Knapsack Problem
European Journal of Combinatorics (64, 2017), pp. 66-87, September 1, 2017

Sören Henning, Klaus Jansen, Malin Rau, and Lars Schmarje
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Cornell University Library (2017), May 12, 2017

Klaus Jansen, Kati Land, and Marten Maack
Estimating the Makespan of the Two-Valued Restricted Assignment Problem
Algorithmica (2017), pp. 1-26, April 27, 2017

Klaus Jansen and Marten Maack
An {EPTAS} for Scheduling on Unrelated Machines of Few Different Types
Cornell University Library (2017), January 12, 2017

Klaus Jansen, Kim-Manuel Klein, Maria Kosche, and Leon Ladewig
Online Strip Packing with Polynomial Migration
The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems(APPROX 2017),
Berkeley, USA, August 16 - 18, 2017

Klaus Jansen and Lars Rohwedder
A Quasi-Polynomial Approximation for the Restricted Assignment Problem
The 19th Conference on Integer Programming and Combinatorial Optimization(IPCO 2017),
Waterloo, Canada, June 26 - 28, 2017

Klaus Jansen and Kim-Manuel Klein
New Structural Results for Bin Packing with a Constant Number of Item Types
The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems(MAPSP 2017),
Seeon Abbey, Germany, June 12 - 16, 2017

Klaus Jansen, Kim-Manuel Klein, and José Verschae
Improved Efficient Approximation Schemes for Scheduling Jobs on Identical and Uniform Machines
The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems(MAPSP 2017),
Seeon Abbey, Germany, June 12 - 16, 2017

Klaus Jansen
New Algorithmic Results for Bin Packing and Scheduling
The 10th International Conference on Algorithms and Complexity(CIAC 2017),
Athens, Greece, May 24 - 26, 2017

Klaus Jansen, Marten Maack, and Roberto Solis-Oba
Structural Parameters for Scheduling with Assignment Restrictions
The 10th International Conference on Algorithms and Complexity(CIAC 2017),
Athens, Greece, May 24 - 26, 2017

Klaus Jansen and Malin Rau
Improved Approximation for two Dimensional Strip Packing with Polynomial Bounded Width
The 11th International Conference and Workshops on Algorithms and Computation(WALCOM 2017),
Hsinchu, Taiwan, March 29 - 31, 2017, springer LNCS 10167, 409-420

Klaus Jansen and Lars Rohwedder
Structured Instances of Restricted Assignment with Two Processing Times
The third International Conference on Algorithms and Discrete Applied Mathematics(CALDAM 2017),
Goa, India, February 13 - 18, 2017, Springer LNCS 10156, 230-241

Klaus Jansen and Kim-Manuel Klein
About the Structure of the Integer Cone and its Application to Bin Packing
ACM-SIAM Symposium on Discrete Algorithms (SODA 2017),
Barcelona, Spain, January 16 - 19, 2017

Klaus Jansen and Lars Rohwedder
On the Configuration-LP of the Restricted Assignment Problem
ACM-SIAM Symposium on Discrete Algorithms (SODA 2017),
Barcelona, Spain, January 16 - 19, 2017