Approximating Subdense Instances of Covering Problems-Reference-Cited by-同舟云学术

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

Approximating Subdense Instances of Covering Problems

Published:2011-08 Issue: Volume:37 Page:297-302
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Cardinal Jean,Karpinski Marek,Schmied Richard,Viehmann Claus

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference10 articles.

1. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems;Arora;Proc. 27th STOC,1995

2. Connected Vertex Covers in Dense Graphs;Cardinal;Theor. Comput. Sci.,2010

3. The Steiner Problem in Graphs;Dreyfus;Networks,1971

4. W. Fernandez de la Vega, M. Karpinksi, Approximation Complexity of Nondense Instances of MAX-CUT, ECCC TR06-101, 2006.

5. Steiner Trees in Uniformly Quasi-Bipartite Graphs;Gröpl;Inf. Process. Lett.,2002

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

1. On the approximability of Dense Steiner Problems;Journal of Discrete Algorithms;2013-07

2. Approximating edge dominating set in dense graphs;Theoretical Computer Science;2012-01

3. Approximating Edge Dominating Set in Dense Graphs;Lecture Notes in Computer Science;2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP