Exponential inapproximability and FPTAS for scheduling with...

Theoretical Computer Science 2009 Vol. 410; Iss. 27-29

Exponential inapproximability and FPTAS for scheduling with availability constraints

Bin Fu, Yumei Huo, Hairong Zhao
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
410
Year:
2009
Language:
english
Pages:
12
DOI:
10.1016/j.tcs.2009.03.012
File:
PDF, 970 KB
english, 2009
Conversion to is in progress
Conversion to is failed