Hardness of routing with congestion in directed graphs
暂无分享,去创建一个
Venkatesan Guruswami | Sanjeev Khanna | Kunal Talwar | Julia Chuzhoy | Kunal Talwar | S. Khanna | V. Guruswami | Julia Chuzhoy
[1] Clifford Stein,et al. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .
[2] Aravind Srinivasan,et al. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[3] Subhash Khot,et al. Query efficient PCPs with perfect completeness , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[4] Joseph Naor,et al. New hardness results for congestion minimization and machine scheduling , 2004, STOC '04.
[5] Lisa Zhang,et al. Logarithmic hardness of the directed congestion minimization problem , 2006, STOC '06.
[6] Lisa Zhang,et al. Hardness of the undirected congestion minimization problem , 2005, STOC '05.
[7] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[8] Venkatesan Guruswami,et al. Hardness of Low Congestion Routing in Directed Graphs , 2006, Electron. Colloquium Comput. Complex..
[9] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[10] Sanjeev Khanna,et al. Hardness of Directed Routing with Congestion , 2006, Electron. Colloquium Comput. Complex..
[11] Sanjeev Khanna,et al. Edge disjoint paths revisited , 2003, SODA '03.
[12] Lisa Zhang,et al. Hardness of the undirected edge-disjoint paths problem with congestion , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[13] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[14] Arild Stubhaug. Acta Mathematica , 1886, Nature.
[15] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[16] Chandra Chekuri,et al. Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.
[17] Lisa Zhang,et al. Logarithmic hardness of the undirected edge-disjoint paths problem , 2006, JACM.
[18] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[19] Subhash Khot,et al. Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[20] Sanjeev Khanna,et al. The all-or-nothing multicommodity flow problem , 2004, STOC '04.
[21] Ganesh Venkataraman,et al. Graph decomposition and a greedy algorithm for edge-disjoint paths , 2004, SODA '04.
[22] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[23] Sanjeev Khanna,et al. Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.
[24] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..