"On the hardness of approximating the UET-UCT scheduling problem with ..."

Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König (2002)

> Home

Details and statistics

DOI: 10.1051/RO:2002003

access: closed

type: Journal Article

metadata version: 2021-09-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rairo/BampisGK02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/BampisGK02
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO Oper. Res. 36(1): 21-36 (2002)

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.