Author:
Bazzi Abbas,Norouzi-Fard Ashkan
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Bansal, N., Khot, S.: Optimal long code test with one free bit. In: Proc. FOCS 2009, FOCS 2009, pp. 453–462. IEEE Computer Society, Washington, DC (2009)
2. Chekuri, C., Bender, M.: An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms 41(2), 212–224 (2001)
3. Chudak, F.A., Shmoys, D.B.: Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms 30(2), 323–343 (1999)
4. Gangal, D., Ranade, A.: Precedence constrained scheduling in (2-7/(3p+1)) optimal. Journal of Computer and System Sciences 74(7), 1139–1146 (2008)
5. Gonzalez, T.F., Johnson, D.B.: A new algorithm for preemptive scheduling of trees. Journal of the ACM (JACM) 27(2), 287–312 (1980)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献