Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

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]

Authors

Sören Henning

This author has not been identified. Look up 'Sören Henning' in Google

Klaus Jansen

This author has not been identified. Look up 'Klaus Jansen' in Google

Malin Rau

This author has not been identified. Look up 'Malin Rau' in Google

Lars Schmarje

This author has not been identified. Look up 'Lars Schmarje' in Google