Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference31 articles.
1. Afrati, F. N., Bampis, E., Chekuri, C., Karger, D. R., Kenyon, C., Khanna, S., et al. (1999). Approximation schemes for minimizing average weighted completion time with release dates. In 40th Annual IEEE symposium on foundations of computer science (pp. 32–44).
2. Albers, S., Baruah, S. K., Möhring, R. H., & Pruhs, K. (2010). 10071 open problems—scheduling. In Dagstuhl seminar proceedings 10071. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
3. Alon, N., & Spencer, J. H. (2016). The probabilistic method (4th ed.). Hoboken: Wiley.
4. Baltag, A., van Ditmarsch, H., & Moss, L. (2008). Epistemic logic and information update. In P. Adriaans & J. van Benthem (Eds.), Handbook of the philosophy of information (pp. 361–456). Amsterdam: Elsevier.
5. Bansal, N., & Pruhs, K. (2014). The geometry of scheduling. SIAM Journal on Computing, 43(5), 1684–1698.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献