Author:
Miao Dongjing,Li Jianzhong,Liu Xianmin,Gao Hong
Publisher
Springer International Publishing
Reference13 articles.
1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)
2. Ásgeirsson, E.I., Stein, C.: Divide-and-conquer approximation algorithm for vertex cover. SIAM J. Discret. Math. 23(3), 1261–1280 (2009)
3. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25, 27–46 (1985)
4. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162, 439–485 (2005)
5. Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180–187 (1972)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献