"Approximation algorithms for scheduling with a limited number of ..."

Chams Lahlou (2000)

> Home

Details and statistics

DOI: 10.1016/S0167-8191(00)00032-6

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/Lahlou00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/Lahlou00
Chams Lahlou:
Approximation algorithms for scheduling with a limited number of communications. Parallel Comput. 26(9): 1129-1162 (2000)

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.