New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set-Reference-Cited by-同舟云学术

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

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set

Published:2014-06-13 Issue:2 Volume:56 Page:330-346
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Escoffier Bruno,Monnot Jérôme,Paschos Vangelis Th.,Xiao Mingyu

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-014-9549-5.pdf

Reference24 articles.

1. Binkele-Raible, D., Fernau, H.: Enumerate and measure: improving parameter budget management. In: Raman, V., Saurabh, S. (eds.) Proc. International Symposium on Parameterized and Exact Computation, IPEC’10, volume 6478 of Lecture Notes in Computer Science, pp 38–49. Springer-Verlag (2010)

2. Bourgeois, N., Escoffier, B., Paschos, V. Th.: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17), 1954–1970 (2011)

3. Brankovic, L., Fernau, H.: A novel parameterised approximation algorithm for minimum vertex cover. Theor. Comput. Sci. 511, 85–108 (2013)

4. Cai, L., Huang, X.: Fixed-parameter approximation: conceptual framework and approximability results. In: Bodlaender, H.L., Langston, M.A. (eds.) Proc. International Workshop on Parameterized and Exact Computation, IWPEC’06, volume 4169 of Lecture Notes in Computer Science, pp 96–108. Springer-Verlag (2006)

5. Cardinal, J., Langerman, S., Levy, E.: Improved approximation bounds for edge dominating set in dense graphs. Theoret. Comput. Sci. 410(8-10), 949–957 (2009)

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

1. Extension of some edge graph problems: Standard, parameterized and approximation complexity;Discrete Applied Mathematics;2023-12

2. Upper and lower bounds on approximating weighted mixed domination;Theoretical Computer Science;2023-01

3. EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET;Fractals;2021-09-16

4. Algorithmic aspects of upper edge domination;Theoretical Computer Science;2021-07

5. Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination;Theoretical Computer Science;2021-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3