A $c^k n$ 5-Approximation Algorithm for Treewidth-Reference-Cited by-同舟云学术

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

A $c^k n$ 5-Approximation Algorithm for Treewidth

Published:2016-01 Issue:2 Volume:45 Page:317-378
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Bodlaender Hans L.,Drange Pål Grǿnås,Dregi Markus S.,Fomin Fedor V.,Lokshtanov Daniel,Pilipczuk Michał

Funder

Bergens Forskningsstiftelse

European Research Council

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/130947374

Reference34 articles.

1. Approximation Algorithms for Treewidth

2. Complexity of Finding Embeddings in a k-Tree

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

1. The parameterized complexity of welfare guarantees in Schelling segregation;Theoretical Computer Science;2024-11

2. The parameterized complexity of finding minimum bounded chains;Computational Geometry;2024-10

3. Fast FPT-Approximation of Branchwidth;SIAM Journal on Computing;2024-08-08

4. A more accurate view of the Flat Wall Theorem;Journal of Graph Theory;2024-05-13

5. Computational complexity of normalizing constants for the product of determinantal point processes;Theoretical Computer Science;2024-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP