Author:
Arkin Esther M.,Bender Michael A.,Mitchell Joseph S. B.,Skiena Steven S.
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of real-time multiple machine scheduling. In Proc. 31st ACM Symp. Theory of Computing, 1999.
2. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
3. D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In CRC Handbook of Computer Science, 1997. To appear.
4. T. Keneally. Schindler’s List. Touchstone Publishers, New York, 1993.
5. E. Lawler, J. Lenstra, A. Kan, and D. Shmoys. Sequencing and scheduling: Algorithms and complexity. In Handbooks of Operations Research and Management Science, volume 4, pages 445–522. Elsevier Science Publishers B.V., 1993.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献