首页> 外文会议>Annual European Symposium on Algorithms >A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing
【24h】

A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing

机译:FPT算法设计技术调查,重点近期进步与实用计算

获取原文

摘要

The talk will survey the rich toolkit of FPT algorithm design methodologies that has developed over the last 20 years, including "older" techniques such as well-quasi-ordering, bounded treewidth, color-coding, reduction to a problem kernel, and bounded search trees - which have continued to deepen and advance - as well as some recently developed approaches such as win/win's, greedy localization, iterative compression, and crown decompositions.
机译:谈话将调查在过去20年中开发的FPT算法设计方法的丰富工具包,包括“较旧”技术,如准订购,有界树木宽,颜色编码,减少到问题内核,以及有界搜索树木 - 继续加深和推进 - 以及最近开发的方法,如获胜/胜利,贪婪的本地化,迭代压缩和冠状分解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号