On the parameterized complexity of approximating dominating set
Author:
Affiliation:
1. Weizmann Institute of Science, Israel
2. Max Planck Institute for Informatics, Germany / Shanghai University of Finance and Economics, China
3. University of California at Berkeley, USA
Funder
ISF-UGC 1399/14
ERC-CoG 772839
NSF CCF-1540685
NSF CCF-1740425
NSF CCF-1655215
I-CORE 4/11
ISF 621/12
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3188745.3188896
Reference69 articles.
1. Exact Weight Subgraphs and the k-Sum Conjecture
2. Losing Weight by Gaining Edges
3. Distributed PCP Theorems for Hardness of Approximation in P
4. Nearly complete graphs decomposable into large induced matchings and their applications
5. Algorithmic construction of sets for k -restrictions
Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the Parameterized Complexity of Compact Set Packing;Algorithmica;2024-09-13
2. On the Parameterized Complexity of Compact Set Packing;WALCOM: Algorithms and Computation;2023
3. On the Parameterized Approximability of Contraction to Classes of Chordal Graphs;ACM Transactions on Computation Theory;2021-12-31
4. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic;Combinatorica;2020-04-28
5. The Inapproximability of k-DominatingSet for Parameterized AC 0 Circuits †;Algorithms;2019-11-04
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3