"Characterizing sets of jobs that admit optimal greedy-like algorithms."

Periklis A. Papakonstantinou, Charles Rackoff (2010)

> Home

Details and statistics

DOI: 10.1007/S10951-009-0148-2

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/PapakonstantinouR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/PapakonstantinouR10
Periklis A. Papakonstantinou, Charles Rackoff:
Characterizing sets of jobs that admit optimal greedy-like algorithms. J. Sched. 13(2): 163-176 (2010)

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.