Algorithms and Complexity Group

Publications

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

2011

Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, and Denis Trystram
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
Discrete Mathematics, Algorithms and Applications 3(4), 553-586, September 2011

Klaus Jansen and Roberto Solis-Oba
A Polynomial Time {OPT+1} algorithm for the cutting stock problem with a constant number of object lengths
Mathematics of Operations Research 36(4), 743-753, August 2011

Klaus Jansen and Roberto Solis-Oba
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
Information Processing Letters 111(10), 479-482, February 2011

Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, and Ola Svensson
Faster approximation algorithms for scheduling with fixed jobs
17th Conference of Computing: the Australasian Theory Symposium (CATS 2011),
Perth, Australia,  January 2011

Rolf Harren, Klaus Jansen, Lars Prädel, and Rob van Stee
A (5/3+eps)-approximation for strip packing
Workshop on Algorithms And Data Structures (WADS 2011),
Brooklyn, NY, USA,  August 15 - 17, 2011, Springer LNCS 6844, 475-487

Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Robenek, and Denis Trystram
Scheduling Jobs on Heterogeneous Platforms
17th Annual International Computing and Combinatorics Conference (COCOON'11),
Dallas, Texas, USA,  August 14 - 16, 2011, Springer LNCS 6842, 271-283

Klaus Jansen and Christina Robenek
Scheduling jobs on identical and uniform processors revisited
9th Workshop on Approximation and Online Algorithms (WAOA 2011),
Saarbrücken, Germany, September 8 - 9, 2011, Springer LNCS 7164, 109-122

Klaus Jansen
Approximation Algorithms for Scheduling and Packing Problems
9th Workshop on Approximation and Online Algorithms (WAOA 2011),
Saarbrücken, Germany, September 8 - 9, 2011, Springer LNCS 7164, 1-8

Copyright

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.