Approximation for vertex cover in $$\beta $$ β -conflict graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Approximation for vertex cover in $$\beta $$ β -conflict graphs

Published:2017-03-21 Issue:4 Volume:34 Page:1052-1059
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Miao Dongjing,Cai Zhipeng,Tong Weitian,Li Jianzhong

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-017-0127-z/fulltext.html

Reference18 articles.

1. Bar-Yehuda R, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Ann Discrete Math 25:27–46

2. Cheetham J, Dehne F, Rau-Chaplin A, Stege U, Taillon PJ (2003) Solving large FPT problems on coarse-grained parallel machines. J Comput Syst Sci 67(4):691–706

3. Chen J, Kanj IA, Xia G (2010) Improved upper bounds for vertex cover. Theor Comput Sci 411(40–42):3736–3756

4. Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439–485

5. Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness II: on completeness for w[1]. Theor Comput Sci 141(1–2):109–131

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP