Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs-Reference-Cited by-同舟云学术

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

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs

Published:2024-02-21 Issue:1 Volume:53 Page:47-86
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Chudnovsky Maria¹^ORCID,Pilipczuk Marcin²^ORCID,Pilipczuk Michał²,Thomassé Stéphan³

Affiliation:

1. Mathematics Department, Princeton University, Princeton, NJ 08544 USA.

2. Institute of Informatics, University of Warsaw, Warsaw, 02-097, Poland.

3. Institut Universitaire de France, Laboratoire d’Informatique du Parallélisme, UMR 5668 ENS Lyon, CNRS, UCBL, INRIA, Université de Lyon, Lyon, 69364, France.

Funder

National Science Foundation

Army Research Office

Horizon 2020 Framework Programme

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Reference24 articles.

1. Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs

2. Approximation algorithms for NP-complete problems on planar graphs

3. Maximum Weight Independent Sets for (P7,triangle)-free graphs in polynomial time

4. A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs

5. On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP