KERNELIZATION

作品数：8被引量：0H指数：0
导出分析报告
相关领域：自动化与计算机技术理学更多>>
相关作者：王伟平更多>>
相关机构：中南大学更多>>
相关期刊：《Science China(Information Sciences)》《Tsinghua Science and Technology》《Journal of Computer Science & Technology》更多>>
相关基金：国家自然科学基金中国博士后科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Tsinghua Science and Technologyx
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
《Tsinghua Science and Technology》2014年第4期329-337,共9页Rodney G.Downey Judith Egan Michael R.Fellows Frances A.Rosamond Peter Shaw 
supported by the Australian Research Council
The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them. We introduce a dynamic version of the DOMI...
关键词：kernelization multivariate algorithms parameterized algorithms turbo-charging heuristics 
Kernelization in Parameterized Computation: A Survey
《Tsinghua Science and Technology》2014年第4期338-345,共8页Qilong Feng Qian Zhou Wenjun Li Jianxin Wang 
supported by the National Natural Science Foundation of China (Nos. 61173051, 61103033, and 61232001)
Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton...
关键词：parameterized computation kernelization parameterized algorithm NP-hard 
An Overview of Kernelization Algorithms for Graph Modification Problems
《Tsinghua Science and Technology》2014年第4期346-357,共12页Yunlong Liu Jianxin Wang Jiong Guo 
supported by the National Natural Science Foundation of China (Nos. 61070224, 61232001, and 61173051);the China Postdoctoral Science Foundation (No. 2012M521551)
Kernelization algorithms for graph modification problems are important ingredients in parameterized computation theory. In this paper, we survey the kernelization algorithms for four types of graph modification proble...
关键词：graph modification problem fixed-parameter tractable kernelization algorithm 
Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges
《Tsinghua Science and Technology》2014年第4期358-373,共16页Robert Bredereck Jiehua Chen Piotr Faliszewski Jiong Guo Rolf Niedermeier Gerhard J.Woeginger 
supported by the Deutsche Forschungsgemeinschaft, project PAWS (NI 369/10);supported by the Studienstiftung des Deutschen Volkes;supported by DFG "Cluster of Excellence Multimodal Computing and Interaction";supported by DIAMANT (a mathematics cluster of the Netherlands Organization for Scientific Research NWO);the Alexander von Humboldt Foundation, Bonn, Germany
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science（including Artificial Intelligence and ...
关键词：NP-hard problems parameterized complexity fixed-parameter tractability kernelization exact algorithms voting decision making cake cutting 
Parameter Ecology for Feedback Vertex Set
《Tsinghua Science and Technology》2014年第4期387-409,共23页Bart M.P.Jansen Venkatesh Raman Martin Vatshelle 
supported by the European Research Council through Starting Grant 306992 "Parameterized Approximation"
This paper deals with the FEEDBACK VERTEX SET problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles. Due it is theoretical and practical importance,the p...
关键词：feedback vertex set parameterized complexity parameter ecology program structural parameterizations kernelization 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部