位置：成果数据库 > 会议 > 会议详情页
<span>Improved FPT Algorithms for Rectilinear k-Links Spanning Path</span>
  • 所属机构名称：中南大学
  • 会议名称：The 9th annual conference on Theory and Applications of Models of Computation (TAMC 2012)
  • 时间：2012.5.6
  • 成果类型：会议
  • 相关项目：参数计算中树分解方法及其应用研究
作者： Jianxin Wang|Jinyi Yao|Qilong Feng|Jianer Chen|
同会议论文项目
参数计算中树分解方法及其应用研究
期刊论文 11 会议论文 11
同项目会议论文
<span>FPT Results for Signed Domination</span>
Parameterized Complexity of Control and Bribery for d-Approval Elections
Random Methods for Parameterized Problems
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees
Kernelization and Lower Bounds of the Signed Domination Problem
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
Randomized Parameterized Algorithms for Co-path Set Problem
On Star-Cover and Path-Cover of a Tree
Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees