Author:
Chakrabarty Deeparnab,Devanur Nikhil R.,Vazirani Vijay V.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference22 articles.
1. Agarwal, A., Charikar, M.: On the advantage of network coding for improving network throughput. In: Proceedings of the IEEE Information Theory Workshop (2004)
2. Calinescu, G., Karloff, H.J., Rabani, Y.: An improved algorithm for the MULTIWAY CUT. Proceedings of Symposium on Theory of Computation (STOC) (1998)
3. Chekuri C., Gupta A., Kumar A.: On a bidirected relaxation for the MULTIWAY CUT problem. Discret. Appl. Math. 150(1-3), 67–79 (2005)
4. Chlebik, M., Chlebikova, J.: Approximation hardness of the steiner tree problem on graphs. Proceedings of Scandinavian Workshop on Algorithm Theory (2002)
5. Cormen T., Leiserson C., Rivest R., Stein C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill, Boston (2001)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献