Author:
Jiang Wei,Liu Tian,Ren Tienan,Xu Ke
Publisher
Springer Berlin Heidelberg
Reference46 articles.
1. 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 J. Comput. 27, 942–959 (1998)
2. Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized Algorithms for the Loop Cutset Problem. J. Artif. Intell. Res. 12, 219–234 (2000)
3. Becker, A., Geiger, D.: Optimization of Pearl method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artificial Intelligence 83, 167–188 (1996)
4. Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)
5. Cai, S., Su, K., Chen, Q.: Ewls: A new local search for minimum vertex cover. In: Proc. of AAAI, pp. 45–50 (2010)
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献