Author:
Chen Xujin,Epstein Leah,Kleiman Elena,van Stee Rob
Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. N. Alon, Y. Azar, G.J. Woeginger, T. Yadid, Approximation schemes for scheduling, in: Proc. 8th Symp. on Discrete Algorithms, SODA’97, 1997, pp. 493–500.
2. The price of stability for network design with fair cost allocation;Anshelevich;SIAM Journal on Computing,2008
3. N. Bansal, M. Sviridenko, The Santa Claus problem, in: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC’06, 2006, pp. 31–40.
4. A performance guarantee for the greedy set-partitioning algorithm;Coffman;Acta Informatica,1984
5. Tight bounds for worst-case equilibria;Czumaj;ACM Transactions on Algorithms,2007
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献