Algorithms and Complexity Group


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


Klaus Jansen and Lorant Porkolab
Linear time approximation schemes for scheduling malleable parallel tasks
Algorithmica 32, 507-520, 2002

Thomas Erlebach and Klaus Jansen
Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees
ACM Journal of Experimental Algorithms 7, Article 6, 2002

Klaus Jansen and Lorant Porkolab
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms 45, 167-191, 2002

Janka Chlebíková
The structure of obstructions to treewidth and pathwidth
Discrete Applied Mathematics 120, no. 1-3, 61-71, 2002

Janka Chlebíková
Partial k-trees with maximum chromatic number
Discrete Mathematics 259, no. 1-3, 269-276, 2002

Miroslav Chlebík and Janka Chlebíková
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems
Electronic Colloquium on Computational Complexity, no. 73, 2002

Klaus Jansen and Lorant Porkolab
On preemptive resource constrained scheduling: polynomial-time approximations schemes
Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002),
MA, USA, September 27 - 21, 2002, Springer LNCS 2337, 329-349

Klaus Jansen
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
Proceedings of the European Symposium on Algorithms (ESA 2002),
Rom, Italy, September 17 - 21, 2002, Springer LNCS 2461, 301-311

Klaus Jansen
Approximate strong separation with application in fractional graph coloring and preemptive scheduling
Proceedings of the Symposium on Theoretical Aspects of Computer Science, (STACS 2002),
Antibes, France, March 14 - 16, 2002, Springer LNCS 2285, 100-111

Klaus Jansen and Roberto Solis-Oba
An asympotic fully polynomial time approximation scheme for bin covering
Proceedings of 13th International Symposium on Algorithms and Computation (ISAAC 2002),
Vancouver, Canada, November 21 - 23, 2002, Springer LNCS 2518, 271-295

Klaus Jansen and Hu Zhang
An approximation algorithm for the multicast congestion problem via minimum Steiner trees
Proceedings of the 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE 2002),
Roma, Italy, September 21, 2002

Guochuan Zhang

On variable-sized bin packing
Proceedings of the 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE 2002),
Roma, Italy, Carleton Scientific, September 21, 2002

Aleksei V. Fishkin and Guochuan Zhang
On Maximizing the Throughput of Multiprocessor Tasks
Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002),
Warszawa - Otwock, Poland, August 26 - 30, 2002, Springer LNCS 2420,  269-279

Klaus Jansen and Hu Zhang
Approximation algorithms for general packing problems with modified logarithmic potential function
Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002),
Montréal, Québec, Canada, August 25 - 30, 2002

Miroslav Chlebík and Janka Chlebíková
Approximation Hardness of the Steiner Tree Problem on Graphs
Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002),
Turku, Finland, July 3 - 5, 2002, Springer LNCS 2368, 95-99


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.