"Useful Structures and How to Find Them: Hardness and Approximation Results ..."

Malin Rau (2019)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2024-10-06

- view
  authority control:
- export record
  dblp key:
  - phd/basesearch/Rau19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/basesearch/Rau19
Malin Rau:
Useful Structures and How to Find Them: Hardness and Approximation Results for Various Variants of the Parallel Task Scheduling Problem (Nützliche Strukturen und wie sie zu finden sind: Nicht Approximierbarkeit und Approximationen für diverse Varianten des Parallel Task Scheduling Problems). Kiel University, Germany, 2019

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.