位置：成果数据库 > 会议 > 会议详情页
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
  • 所属机构名称：中南大学
  • 会议名称：European Symposium on Algorithms
  • 时间：2014.9.8
  • 成果类型：会议
  • 相关项目：参数计算中树分解方法及其应用研究
作者： Wenjun Li|Jianer Chen|Jianxin Wang|
同会议论文项目
参数计算中树分解方法及其应用研究
期刊论文 11 会议论文 11
同项目会议论文
<span>Improved FPT Algorithms for Rectilinear k-Links Spanning Path</span>
<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
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