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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.