"A Polynomial Time Approximation Scheme for General Multiprocessor Job ..."

Jianer Chen, Antonio Miranda (2001)

> Home

Details and statistics

DOI: 10.1137/S0097539798348110

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ChenM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ChenM01
Jianer Chen, Antonio Miranda:
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. SIAM J. Comput. 31(1): 1-17 (2001)

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.