Author:
Gopalakrishnan Ragavendran,Kanoulas Dimitrios,Karuturi Naga Naresh,Pandu Rangan C.,Rajaraman Rajmohan,Sundaram Ravi
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Angel, E., Bampis, E., Pollatos, G.G., Zissimopoulos, V.: Optimal data placement on networks with constant number of clients. CoRR, abs/1004.4420 (2010)
2. Arrow, K.: Social Choice and Individual Values. Yale University Press (1951)
3. Baev, I.D., Rajaraman, R., Swamy, C.: Approximation algorithms for data placement problems. SIAM J. Comput. 38(4), 1411–1429 (2008)
4. Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: SIGCOMM 1998, pp. 56–67 (1998)
5. Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. Journal of the ACM (JACM) 56(3) (2009)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献