It is hard to know when greedy is good for finding independent sets-Reference-Cited by-同舟云学术

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

It is hard to know when greedy is good for finding independent sets

Published:1997-01 Issue:2 Volume:61 Page:101-106
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Bodlaender Hans L.,Thilikos Dimitrios M.,Yamazaki Koichi

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference10 articles.

1. Free bits, PCPs and non-approximability-towards tight results;Bellare,1995

2. Approximating maximum independent set in bounded degree graphs;Berman,1994

3. Introduction to the Theory of Complexity;Bovet,1993

4. A note on well-covered graphs;Chvatal;Ann. Discrete Math.,1993

5. Recognizing greedy structures;Carol;J. Algorithms,1996

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

1. Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs;Algorithmica;2024-09-12

2. Recognizing well-dominated graphs is coNP-complete;Information Processing Letters;2024-01

3. Optimal monotone relabelling of partially non-monotone ordinal data;Optimization Methods and Software;2012-02

4. Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP;RAIRO - Theoretical Informatics and Applications;2005-10-15

5. Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP;Information Processing Letters;1998-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP