位置：成果数据库 > 会议 > 会议详情页
Parameterized Complexity of Control and Bribery for d-Approval Elections
  • 所属机构名称：中南大学
  • 会议名称：Proc. 7th International Conference on Combinatorial Optimization and Applications
  • 时间：2013.12.12
  • 成果类型：会议
  • 相关项目：精确计算和参数计算的算法新技术
同会议论文项目
精确计算和参数计算的算法新技术
期刊论文 21 会议论文 14
同项目会议论文
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees
FPT Results for Signed Domination
Randomized Parameterized Algorithms for Co-path Set Problem
Kernelization and Lower Bounds of the Signed Domination Problem
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees
Random Methods for Parameterized Problems
Dealing with4-Variables by Resolution: An Improved MaxSAT Algorithm
Improved MaxSATAlgorithms for Instances of Degree 3
Improved FPT Algorithms for Rectilinear k-Links Spanning Path
Improved Approximation Algorithm for Maximum Agreement Forest of two Trees
Parameterized Complexity of Control and Bribery for d-Approval Elections
On Star-Cover and Path-Cover of a Tree