Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference31 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications (1993)
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. Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. SIAM J. Comput. 39(7), 2970–2989 (2010)
4. Bateni, M.H., Charikar M., Guruswami, V.: Maxmin allocation via degree lower-bounded arborescences. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 543–552. ACM (2009)
5. Bezáková, I., Dani, V.: Allocating indivisible goods. ACM SIGecom Exch. 5(3), 11–18 (2005)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献