Klaus Jansen
Approximation results for the optimum cost chromatic partition problem
Journal of Algorithms 34, 2000, 54-89

Hans Bodlaender and Klaus Jansen
On the complexity of the maximum cut problem
Nordic Journal of Computing 7, 2000, 14-31

Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, and Claire Kenyon
Scheduling to minimize the average completion time of dedicated tasks
(FSTTCS 2000), K. Sanjiv, P. Sanjiva (Eds), New Delhi, Springer LNCS 1974,  454-464

Klaus Jansen and Lorant Porkolab
Preemptive scheduling on dedicated processors: applications of fractional graph coloring
(MFCS 2000), M. Nielson and B. Rovan (eds.), Bratislava, Springer LNCS 1893, 446-455

Klaus Jansen and Lorant Porkolab
Preemptive parallel task scheduling in O(n)+poly(m) time
(ISAAC 2000), D. T. Lee and S. H. Teng (eds.), Taipeh, Springer LNCS 1969,  398-409

Thomas Erlebach and Klaus Jansen
Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees
(WAE 2000), Saarbrücken, Springer LNCS 1982, 195-206

Klaus Jansen and Monaldo Mastrolilli
Parallel machine scheduling problems with controllable processing times
Workshop on Approximation and Randomization Algorithms in Communication Networks, (ARACNE 2000), J. Rolim et al. (eds),
Geneva, Carleton Scientific, 2000, 179-190 (gzipped ps-file)

Thomas Erlebach and Klaus Jansen
Conversion of coloring algorithms into maximum weight independent set algorithms
Workshop on Approximation and Randomization Algorithms in Communication Networks, (ARACNE 2000), J. Rolim et al. (eds),
Geneva, Carleton Scientific, 2000, 135-146 (gzipped ps-file)

Klaus Jansen and Lorant Porkolab
Polynomial time approximation schemes for general multiprocessor job shop scheduling
27. International Colloquium on Automata, Languages and Programming (ICALP 2000), U. Montanari, J. Rolim and E. Welzl (eds),
Geneva, 2000, Springer LNCS 1853, 878-889

Klaus Jansen, Monaldo Mastrolilli, and Roberto Solis-Oba
Approximation algorithms for flexible job shop problems
4. Latin American Theoretical Informatics (LATIN 2000),
Punta del Este, 2000, Springer LNCS 1776, 68-77

Klaus Jansen and Maxim Sviridenko
Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem
17. Symposium on Theoretical Aspects of Computer Science (STACS 2000), H. Reichel and S. Tison (eds),
Lille, 2000, Springer LNCS 1770, 455-565

 

---

Urheberrecht