Author:
Fomin Fedor V.,Lokshtanov Daniel,Raman Venkatesh,Saurabh Saket
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference28 articles.
1. O. Amini, F.V. Fomin, S. Saurabh, Implicit branching and parameterized partial cover problems, J. Comput. System Sci. (2008), doi:10.1016/j.jcss.2010.12.002.
2. S. Arora, G. Karakostas, A 2+epsilon approximation algorithm for the -MST problem, in: SODA, 2000, pp. 754–759.
3. R. Bar-Yehuda, Using homogenous weights for approximating the partial cover problem, in: SODA, 1999, pp. 71–75.
4. Computing small partial coverings;Bläser;Inform. Process. Lett.,2003
5. Subexponential parameterized algorithms on bounded-genus graphs and -minor-free graphs;Demaine;J. ACM,2005
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献