Author:
Khot Subhash,Ponnuswami Ashok Kumar
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: STOC 2007 (to appear)
2. Azar, Y., Epstein, L.: On-line machine covering. J. Sched. 1(2), 67–77 (1998)
3. Bansal, N., Sviridenko, M.: The santa claus problem. In: STOC 2006. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 31–40. ACM Press, New York (2006)
4. Bezáková, I., Dani, V.: Allocating indivisible goods. SIGecom Exchanges 5(3), 11–18 (2005)
5. Epstein, L.: Tight bounds for bandwidth allocation on two links. Discrete Appl. Math. 148(2), 181–188 (2005)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献