Author:
Liu Pengcheng,Zhang Zhao,Huang Xiaohui
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. Polylogarithmic approximation algorithms for weighted-F-deletion problems;Agrawal,2017
2. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math.,1985
3. Minimum k-path vertex cover;Brešar;Discrete Appl. Math.,2011
4. The k-separator problem: polyhedra, complexity and approximation results;Ben-Ameur;J. Comb. Optim.,2015
5. Fixed-parameter algorithms for vertex cover P3;Chang;Discrete Optim.,2016
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献