"Complexity and Inapproximability Results for Parallel Task Scheduling and ..."

Sören Henning et al. (2020)

> Home

Details and statistics

DOI: 10.1007/S00224-019-09910-6

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/HenningJRS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/HenningJRS20
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.