Author:
Burkard R. E.,He Y.,Kellerer H.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference10 articles.
1. SFB Report;R. E. Burkard,1997
2. Friesen, D. K., Langston, M. A.: Analysis of a compound bin packing algorithm. SIAM J. Discr. Math.4, 61–79 (1991).
3. Gonzalez, T., Ibarra, O. H., Sahni, S.: Bounds for LPT scheduling on uniform processors. SIAM J. Comput.6, 155–166 (1977).
4. He, Y., Kellerer, H., Kotov, V.: Linear compound algorithms for the partitioning problem (submitted).
5. Hochbaum, D. S., Shmoys, D. B.: A polynomial approximation scheme for scheduling on uniform processors. Using the dual approximation approach, SIAM J. Comput.17, 539–551 (1988).
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献