Author:
Kanj Iyad A.,Zhang Fenghui
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Lecture Notes in Computer Science;F. Abu-Khzam,2007
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial optimization problems and their approximability properties. Springer, Heidelberg (1999)
3. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the Weighted Vertex Cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
4. Cai, X.: Linear kernelizations for restricted 3-hitting set problems. Inf. Process. Lett. 109(13), 730–738 (2009)
5. Caro, Y., Tuza, Z.: Improved lower bounds on k-independence. Journal of Graph Theory 15, 99–107 (1991)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献