Author:
Shi Yangguang,Zhang Fa,Liu Zhiyong
Publisher
Springer International Publishing
Reference17 articles.
1. Ahuja, R., Magnanti, T., Orlin, J.: Multicommodity Flows. In: Network Flows: Theory, Algorithms, and Applications, pp. 649–694. Prentice Hall (1993)
2. Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-cost network design with (dis)economies of scale. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 585–592 (October 2010)
3. Andrews, M., Anta, A.F., Zhang, L., Zhao, W.: Routing for power minimization in the speed scaling model. IEEE/ACM Transactions on Networking 20(1), 285–294 (2012)
4. Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS 1996. IEEE Computer Society (1996)
5. Bhaskara, A., Vijayaraghavan, A.: Approximating matrix p-norms. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 497–511. SIAM (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献