Author:
Hajiaghayi MohammadTaghi,Khandekar Rohit,Kortsarz Guy,Nutov Zeev
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Bar-Ilan, J., Kortsarz, G., Peleg, D.: Generalized submodular cover problems and applications. Theor. Comput. Sci. 250(1-2), 179–200 (2001)
2. Bartal, Y.: On approximating arbitrary metrices by tree metrics. In STOC, pp. 161–168 (1998)
3. Calinescu, G., Zelikovsky, A.: The polymatroid steiner problems. J. Comb. Optim. 9(3), 281–294 (2005)
4. Carr, R., Fleischer, L., Leung, V., Phillips, C.: Strengthening integrality gaps for capacitated network design and covering problems. In SODA, pp. 106–115 (2000)
5. Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of capacitated network design. In IPCO, pp. 78–91 (2011)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献