Algorithms and Complexity Group


2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999  1998-1988


Marin Bougeret, Pierre-François Dutot, Denis Trystram, Klaus Jansen, and Christina Robenek
Improved approximation algorithms for scheduling parallel jobs on identical clusters
Theoretical Computer Science (600), 70-85, 2015

Klaus Jansen
Efficient polynomial time approximation scheme for scheduling jobs on uniform processors
Encyclopedia of Algorithms, 2015

Kim-Manuel Klein
Robust bin packing
Encyclopedia of Algorithms, 2015

Klaus Jansen and Stefan Kraft
An improved approximation scheme for variable-sized bin packing
Theory of Computing Systems, 2015

Klaus Jansen and Stefan Kraft
A faster FPTAS for the unbounded knapsack problem
26th Workshop on Combinatorial Algorithms (IWOCA 2015),
Verona, Italy, October 5 -7, 2015, Springer LNCS 9538, 274-286

Florian Diedrich, Klaus Jansen, and Niklas Paulsen
Heuristic approaches to minimize tour duration for the TSP with multiple time windows
15th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2015),
Patra, Greece, September 17, 2015

Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein
Fully dynamic bin packing revisited
Approximation Algorithms for Combinatorial Optimization Problems, and Randomization and Computation (APPROX-RANDOM 2015),
Princeton, USA, August 24 - 26, 2015


Copyright and all rights concerning the documents distributed by this server rest with the authors or other copyright holders. They may not be reposted without the copyright holders' explicit permission. The authors offer these documents here solely to ensure that others working in the same field have ready access to their scholarly or technical work on a noncommercial basis, and on condition that all users copying these documents do so respecting the terms and constraints set by the copyright.