An approximation scheme for scheduling of malleable parallel tasks

Klaus Jansen. An approximation scheme for scheduling of malleable parallel tasks. In Panos M. Pardalos, Sanguthevar Rajasekaran, José Rolim, editors, Randomization Methods in Algorithm Design, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, December 12-14, 1997. Volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 109-122, DIMACS/AMS, 1997.

@inproceedings{Jansen97a,
  title = {An approximation scheme for scheduling of malleable parallel tasks},
  author = {Klaus Jansen},
  year = {1997},
  researchr = {https://researchr.org/publication/Jansen97a},
  cites = {0},
  citedby = {0},
  pages = {109-122},
  booktitle = {Randomization Methods in Algorithm Design, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, December 12-14, 1997},
  editor = {Panos M. Pardalos and Sanguthevar Rajasekaran and José Rolim},
  volume = {43},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}