From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More-Reference-Cited by-同舟云学术

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

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

Published:2020-01 Issue:4 Volume:49 Page:772-810
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Chalermsook Parinya,Cygan Marek,Kortsarz Guy,Laekhanukit Bundit^ORCID,Manurangsi Pasin,Nanongkai Danupon^ORCID,Trevisan Luca

Funder

Swedish Research Council

Israeli Centers for Research Excellence

H2020 European Research Council

Israel Science Foundation

National Science Foundation

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

https://epubs.siam.org/doi/pdf/10.1137/18M1166869

Reference64 articles.

1. Proof verification and the hardness of approximation problems

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

1. A survey on the parameterized complexity of reconfiguration problems;Computer Science Review;2024-08

2. Exact and heuristic algorithms for the domination problem;European Journal of Operational Research;2024-03

3. Pliability and Approximating Max-CSPs;Journal of the ACM;2023-11-30

4. Parameterized Inapproximability of Independent Set in H-Free Graphs;Algorithmica;2022-10-20

5. A characterization of approximability for biased CSPs;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP