Author:
Chekuri Chandra,Korula Nitish
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Aazami, A., Cheriyan, J., Jampani, K.R.: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees. Algorithmica (manuscript submitted, 2008)
2. Calinescu, G., Chekuri, C., Vondrak, J.: Disjoint Bases in a Polymatroid. Random Structures & Algorithms (to appear)
3. Chakraborty, T., Chuzhoy, J., Khanna, S.: Network Design for Vertex Connectivity. In: Proc. of ACM STOC, pp. 167–176 (2008)
4. Chekuri, C., Korula, N.: Single-Sink Network Design with Vertex-Connectivity Requirements. In: Proc. of FST&TCS (2008)
5. Chekuri, C., Shepherd, B.: Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. on Disc. Math. 23(1), 163–177 (2008)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献