Author:
Chekuri Chandra,Shepherd F. Bruce,Weibel Christophe
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Hardness of the undirected congestion minimization problem;Andrews;SIAM J. Comput.,2007
2. An O(logk) approximate min-cut max-flow theorem and approximation algorithm;Aumann;SIAM J. Comput.,1998
3. A. Chakrabarti, L. Fleischer, C. Weibel, When the cut condition is enough: A complete characterization for multiflow problems in series-parallel networks, in: Proc. of ACM STOC, 2012, pp. 19–26.
4. A. Chakrabarti, A. Jaffe, J. Lee, J. Vincent, Local moves and lossy invariants in planar graph embeddings, in: Proc. of IEEE FOCS, 2008.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献