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

1999

Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, and Pino Persiano
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science 221, 119-137, 1999

Klaus Jansen
An approximation scheme for bin packing with conflicts
Journal of Combinatorial Optimization 3, 363-377, 1999

Thomas Erlebach and Klaus Jansen
Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks
ACM Journal of Experimental Algorithms, article no.: 4, 1999

Klaus Jansen and Lorant Porkolab
Linear-time approximation schemes for scheduling malleable parallel tasks
10th Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA 1999),
Baltimore, Maryland, USA, 490-498

Klaus Jansen and Lorant Porkolab
Improved approximation schemes for scheduling unrelated parallel machines
31st Annual ACM Symposium on Theory of Computing (STOC 1999),
Atlanta, USA, 408-417

Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko
Makespan minimization in job shops: a polynomial time approximation scheme
31st Annual ACM Symposium on Theory of Computing (STOC 1999),
Atlanta, USA, 394-399

Klaus Jansen and Lorant Porkolab
General multiprocessor task scheduling: approximate solutions in linear time
6th International Workshop on Algorithms and Data Structures (WADS 1999),
Vancouver, Canada, Springer LNCS 1663, 110-121

Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko
A linear time approximation scheme for job shop scheduling
3th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 1999),
Berkeley, USA, Springer LNCS 1671, 177-188

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.