Improved Steiner tree algorithms for bounded treewidth-Reference-Cited by-同舟云学术

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

Improved Steiner tree algorithms for bounded treewidth

Published:2012-10 Issue: Volume:16 Page:67-78
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Chimani Markus,Mutzel Petra,Zey Bernd

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference31 articles.

1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987

2. Prize-collecting Steiner problems on planar graphs;Bateni,2011

3. Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth;Bateni,2010

4. Improved bounds on Bell numbers and on moments of sums of random variables;Berend;Probability and Mathematical Statistics,2010

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

1. An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth;Theoretical Computer Science;2024-04

2. On convexity in split graphs: complexity of Steiner tree and domination;Journal of Combinatorial Optimization;2024-02-12

3. Tight Double Exponential Lower Bounds;Lecture Notes in Computer Science;2024

4. Computational Design of Wiring Layout on Tight Suits with Minimal Motion Resistance;SIGGRAPH Asia 2023 Conference Papers;2023-12-10

5. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering;SIAM Journal on Computing;2022-12-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP