Author:
Zhang Kejia,Gao Hong,Li Jianzhong
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference14 articles.
1. M. Andrews, J. Chuzhoy, L. Zhang, Hardness of the undirected edge-disjoint paths problem with congestion, in: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
2. C. Chekuri, S. Khanna, F.B. Shepherd, Edge-disjoint paths in planar graphs, in: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
3. An o(n) approximation and integrality gap for disjoint paths and unsplittable flow;Chekuri;Theory of Computing,2006
4. Highly-resilient, energy-efficient multipath routing in wireless sensor networks;Ganesan;ACM SIGMOBILE Mobile Computing and Communications Review,2001
5. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems;Guruswami;Journal of Computer and System Sciences,2003