Funder
German-Israeli Foundation for Scientific Research and Development
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. Alon, N., Azar, Y., Woeginger, G. J., Yadid, T.: Approximation schemes for scheduling. In: Proceedings of the 8th Symposium on Discrete Algorithms (SODA 1997), pp. 493–500 (1997)
2. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55–66 (1998)
3. Berg, B.P., Denton, B.T.: Fast approximation methods for online scheduling of outpatient procedure centers. INFORMS J. Comput. 29(4), 631–644 (2017)
4. Cesati, M., Trevisan, L.: On the efficiency of polynomial time approximation schemes. Inf. Process. Lett. 64(4), 165–171 (1997)
5. Coffman, E., Lueker, G.S.: Approximation algorithms for extensible bin packing. J. Sched. 9(1), 63–69 (2006)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献