Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference42 articles.
1. Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5), 1211–1233 (2011)
2. Anshelevich, E., Dasgupta, A., Kleinberg, J. M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602–1623 (2008)
3. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of Approximation algorithms for k-Set cover using factor-revealing linear programs. Theory of Computing Systems 45(3), 555–576 (2009)
4. Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC), pp 57–66. ACM Press, New York (2005)
5. Awerbuch, B., Azar, Y., Grove, E. F., Kao, M. -Y., Krishnan, P., Vitter, J.S.: Load balancing in the l p norm. In: Proceedings of the 36th annual symposium on foundations of computer science (FOCS). IEEE Computer Society, pp 383–391 (1995)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献