Author:
Dehne Frank,Fellows Michael,Langston Michael A.,Rosamond Frances,Stevens Kim
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for Dominating Set and related problems on planar graphs. Algorithmica 33, 461–493 (2002)
2. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Arge, L., Italiano, G., Sedgewick, R. (eds.) Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX),, New Orleans, January 2004. Proc. Applied Mathematics, vol. 115, ACM/SIAM (2004)
3. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics 12, 289–297 (1999)
4. Becker, A., Bar-Yehuda, R., Geiger, D.: Random algorithms for the loop cutset problem. Journal of Artificial Intelligence Research 12, 219–234 (2000)
5. Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing 27, 942–959 (1998)
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献