Author:
Khandekar Rohit,Kortsarz Guy,Nutov Zeev
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference30 articles.
1. Additive guarantees for degree bounded directed network design;Bansal;SIAM J. Comput.,2009
2. Generalized submodular cover problems and applications;Bar-Ilan;Theoret. Comput. Sci.,2001
3. Approximation algorithms for directed Steiner problems;Charikar;J. Algorithms,1999
4. Y.H. Chen, C.L. Lu, C.Y. Tang, On the full and bottleneck full steiner tree problems, in: COCOON, 2003, pp. 122–129.
5. On approximation algorithms for the terminal Steiner tree problem;Drake;Inform. Process. Lett.,2004
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献