Author:
Chitnis Rajesh,Hajiaghayi MohammadTaghi,Kortsarz Guy
Publisher
Springer International Publishing
Reference21 articles.
1. Arora, S., Lund, C.: Approximation algorithms for NP-hard problems. In: Hochbaum, D. (ed.) PWS Publishing Co., Boston (1997)
2. Bellare, M., Goldwasser, S., Lund, C., Russeli, A.: Efficient probabilistically checkable proofs and applications to approximations. In: STOC (1993)
3. Cai, L.: Parameterized complexity of cardinality constrained optimization problems. Comput. J. 51(1), 102–121 (2008)
4. Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)
5. Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks 1(3) (1971)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献