"Tight approximation algorithms for scheduling with fixed jobs and ..."

Florian Diedrich et al. (2012)

> Home

Details and statistics

DOI: 10.1145/2229163.2229171

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/DiedrichJPSS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/DiedrichJPSS12
Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Tight approximation algorithms for scheduling with fixed jobs and nonavailability. ACM Trans. Algorithms 8(3): 27:1-27:15 (2012)

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.