Author:
Deng Yunyun,Guo Longkun,Huang Peihuang
Publisher
Springer International Publishing
Reference21 articles.
1. Chuzhoy, J.: Routing in undirected graphs with constant congestion. SIAM J. Comput. 45(4), 1490–1532 (2016)
2. Chuzhoy, J., Li, S.: A polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2. J. ACM (JACM) 63(5), 45 (2016)
3. Lecture Notes in Computer Science;R Fleischer,2007
4. Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. WH Freeman, New York (2002)
5. Guo, L., Deng, Y., Liao, K., He, Q., Sellis, T., Hu, Z.: A fast algorithm for optimally finding partially disjoint shortest paths. In: Accepted by the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, IJCAI (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献