Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje. Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Theory Comput. Syst., 64(1):120-140, 2020. [doi]
@article{HenningJRS20,
title = {Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing},
author = {Sören Henning and Klaus Jansen and Malin Rau and Lars Schmarje},
year = {2020},
doi = {10.1007/s00224-019-09910-6},
url = {https://doi.org/10.1007/s00224-019-09910-6},
researchr = {https://researchr.org/publication/HenningJRS20},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {64},
number = {1},
pages = {120-140},
}