Author:
Ilie Lucian,Solis-Oba Roberto,Yu Sheng
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2, 198–203 (1981)
2. Lecture Notes in Computer Science;J.-M. Champarnaud,2003
3. Champarnaud, J.-M., Coulon, F.: NFA reduction algorithms by means of regular inequalities. Theoret. Comput. Sci. 327(3), 241–253
4. Champarnaud, J.-M., Coulon, F.: NFA reduction algorithms by means of regular inequalities – correction. Theoret. Comput. Sci. (to appear)
5. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献