A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem-Reference-Cited by-同舟云学术

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

A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem

Published:1985 Issue: Volume: Page:27-45
ISSN:0304-0208
Container-title:Analysis and Design of Algorithms for Combinatorial Problems
language:
Short-container-title:

Author:

Bar-Yehuda R.,Even S.

Publisher

Elsevier

Reference21 articles.

1. A Linear Time Approximation Algorithm for the Weighted Vertex Cover Problem;Bar-Yehuda;J. of Algorithms,1981

2. Bar-Yehuda, R., and S. Even “On Approximating a Vertex Cover for Planar Graphs”, Proc. 14th Ann. ACM Symp. Th. Computing, 1982, 303–309.

3. Graph Theory and Applications;Bondy,1976

4. A Greedy-Heuristic for the Set-Covering Problem;Chvatal;Math. Operations Res.,1979

5. Applications of the Upton and Tarjan's Planar Separator Theorem;Chiba;J Information Proc.,1981

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximating power node-deletion problems;Theoretical Computer Science;2024-10

2. Reliability-Aware VNF Provisioning in Homogeneous and Heterogeneous Multi-access Edge Computing;Lecture Notes in Computer Science;2024

3. Fast convergence to an approximate solution by message-passing for complex optimizations;Nonlinear Theory and Its Applications, IEICE;2024

4. Application of Minimum Vertex Cover Problem in Functional Brain Connectivity Graphs;2023 Innovations in Intelligent Systems and Applications Conference (ASYU);2023-10-11

5. A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion;European Journal of Combinatorics;2023-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP