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


Klaus Jansen and Hu Zhang
An approximation algorithm for scheduling malleable tasks under general precedence constraints
ACM Transactions on Algorithms , volume 2, number 3, 416-434, July 2006

Klaus Jansen
An approximation algorithm for the general max-min resource sharing problem
Mathematical Programming, volume 106, number 3, 547-566, July 2006

Klaus Jansen
Approximation algorithm for the mixed fractional packing and covering problem
SIAM Journal on Optimization , volume 17, 331-352, 2006

Klaus Jansen and Lorant Porkolab
On preemptive resource constrained scheduling: polynomial time approximation schemes
SIAM Journal on Discrete Mathematics , volume 20, 545-563, 2006

Klaus Jansen and Roberto Solis-Oba
An asymptotic approximation algorithm for 3D-strip packing
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2006),
Miami, Florida, USA, January 22 - 24, 2006, 143-152

Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff
A new approximation algorithm for labeling weighted points with sliding labels
Proceedings of the 22nd European Workshop on Computational Geometry (EWCG 2006),
Delphi, Greece, March 27 - 29, 2006, 137-140

Mihhail Aizatulin, Florian Diedrich, and Klaus Jansen
Implementation of approximation algorithms for the max-min resource sharing problem
Proceedings of the 4th International Workshop on Experimental Algorithms (WEA 2006),
Menorca Island, Spain, May 24 - 27, 2006, Springer LNCS 4007 , 207-218   


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.