Maximum bipartite flow in networks with adaptive channel width
暂无分享,去创建一个
Aravind Srinivasan | Yossi Azar | Debmalya Panigrahi | Aleksander Madry | Thomas Moscibroda | A. Madry | Y. Azar | T. Moscibroda | Debmalya Panigrahi | A. Srinivasan
[1] David R. Karger,et al. Using random sampling to find maximum flows in uncapacitated undirected graphs , 1997, STOC '97.
[2] David R. Karger. Better random sampling algorithms for flows in undirected graphs , 1998, SODA '98.
[3] David R. Karger,et al. Finding maximum flows in undirected graphs seems easier than bipartite matching , 1998, STOC '98.
[4] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[5] Yishay Mansour,et al. Auctions with Budget Constraints , 2004, SWAT.
[6] David R. Karger,et al. Random sampling in residual graphs , 2002, STOC '02.
[7] Gerhard J. Woeginger,et al. All-norm approximation algorithms , 2002, J. Algorithms.
[8] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[9] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[10] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[11] 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.
[12] Jon M. Kleinberg,et al. Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[13] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[14] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[15] Amit Kumar,et al. Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.
[16] Andrew V. Goldberg,et al. Beyond the flow decomposition barrier , 1998, JACM.
[17] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[18] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[19] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..
[20] Yunnan Wu,et al. Load-aware spectrum distribution in Wireless LANs , 2008, 2008 IEEE International Conference on Network Protocols.
[21] K. J. Lee,et al. Algorithm for Solution of a Problem of Maximumow in a Network with Power Estimation , 2007 .
[22] Paramvir Bahl,et al. A case for adapting channel width in wireless networks , 2008, SIGCOMM '08.
[23] Yossi Azar,et al. Combinatorial Algorithms for the Unsplittable Flow Problem , 2005, Algorithmica.
[24] Sanjeev Khanna,et al. An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow , 2006, Theory Comput..
[25] C.E. Shannon,et al. Communication in the Presence of Noise , 1949, Proceedings of the IRE.
[26] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..