"New Fully Polynomial Time Approximation Scheme for the Makespan ..."

Imed Kacem (2010)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2011-07-01

- no documents available
- export record
  dblp key:
  - conf/colognetwente/Harutyunyan10a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colognetwente/Harutyunyan10a
Imed Kacem:
New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval. CTW 2010: 101-104

a service of

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.