- Liming Cai;Iyad Kanj;Frances A.Rosamond;
<正>Dedication.This Special Issue on Parameterized Complexity of Tsinghua Science and Technology is a tribute to the influential contributions of Jianer Chen to parameterized complexity algorithmics.It is an occasion to celebrate the many important contributions to this new and prospering branch of theoretical computer science made by Jianer Chen,as he reaches the ripe young age of 60.Happy birthday,Jianer,from
2014年04期 v.19 323-324页 [查看摘要][在线阅读][下载 71K] [下载次数：17 ] |[网刊下载次数：0 ] |[引用频次：0 ] |[阅读次数：0 ] - Michael Ralph Fellows;
This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics.
2014年04期 v.19 325-328页 [查看摘要][在线阅读][下载 146K] [下载次数：25 ] |[网刊下载次数：0 ] |[引用频次：1 ] |[阅读次数：0 ] - Rodney G.Downey;Judith Egan;Michael R.Fellows;Frances A.Rosamond;Peter Shaw;
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 DOMINATING SET problem and prove that it is fixed-parameter tractable(FPT). The problem is motivated by settings where problem instances evolve. It also arises in the quest to improve a natural greedy heuristic for the DOMINATING SET problem.
2014年04期 v.19 329-337页 [查看摘要][在线阅读][下载 367K] [下载次数：22 ] |[网刊下载次数：0 ] |[引用频次：1 ] |[阅读次数：0 ] - Qilong Feng;Qian Zhou;Wenjun Li;Jianxin Wang;
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 in parameterized computation has recently become an active research area. In this paper, we discuss several kernelizaiton techniques, such as crown decomposition, planar graph vertex partition, randomized methods, and kernel lower bounds, which have been used widely in the kernelization of many hard problems.
2014年04期 v.19 338-345页 [查看摘要][在线阅读][下载 266K] [下载次数：21 ] |[网刊下载次数：0 ] |[引用频次：0 ] |[阅读次数：0 ] - Yunlong Liu;Jianxin Wang;Jiong Guo;
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 problems, which include vertex deletion problems, edge editing problems, edge deletion problems, and edge completion problems. For each type of problem, we outline typical examples together with recent results, analyze the main techniques, and provide some suggestions for future research in this field.
2014年04期 v.19 346-357页 [查看摘要][在线阅读][下载 691K] [下载次数：33 ] |[网刊下载次数：0 ] |[引用频次：1 ] |[阅读次数：0 ] - Robert Bredereck;Jiehua Chen;Piotr Faliszewski;Jiong Guo;Rolf Niedermeier;Gerhard J.Woeginger;
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 Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context. This work is dedicated to Jianer Chen, one of the strongest problem solvers in the history of parameterized algorithmics,on the occasion of his 60 th birthday.
2014年04期 v.19 358-373页 [查看摘要][在线阅读][下载 314K] [下载次数：32 ] |[网刊下载次数：0 ] |[引用频次：6 ] |[阅读次数：0 ] - Henning Fernau;Fedor V.Fomin;Daniel Lokshtanov;Matthias Mnich;Geevarghese Philip;Saket Saurabh;
We analyze a common feature of p-Kemeny AGGregation(p-KAGG) and p-One-Sided Crossing Minimization(p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG—a problem in social choice theory—and for p-OSCM—a problem in graph drawing. These algorithms run in time O.2O.pk logk//,where k is the parameter, and significantly improve the previous best algorithms with running times O.1.403k/and O.1.4656k/, respectively. We also study natural "above-guarantee" versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p-directed feedback arc set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of "votes" in the input to p-KAGG is odd the above guarantee version can still be solved in time O.2O.pk logk//, while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails(equivalently, unless FPT D M[1]).
2014年04期 v.19 374-386页 [查看摘要][在线阅读][下载 324K] [下载次数：26 ] |[网刊下载次数：0 ] |[引用频次：3 ] |[阅读次数：0 ] - Bart M.P.Jansen;Venkatesh Raman;Martin Vatshelle;
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 problem has been the subject of intensive study. Motivated by the parameter ecology program we attempt to classify the parameterized and kernelization complexity of FEEDBACK VERTEX SET for a wide range of parameters.We survey known results and present several new complexity classifications. For example, we prove that FEEDBACK VERTEX SET is fixed-parameter tractable parameterized by the vertex-deletion distance to a chordal graph. We also prove that the problem admits a polynomial kernel when parameterized by the vertex-deletion distance to a pseudo forest, a graph in which every connected component has at most one cycle. In contrast, we prove that a slightly smaller parameterization does not allow for a polynomial kernel unless NP ? coNP=poly and the polynomial-time hierarchy collapses.
2014年04期 v.19 387-409页 [查看摘要][在线阅读][下载 736K] [下载次数：18 ] |[网刊下载次数：0 ] |[引用频次：0 ] |[阅读次数：0 ] - Chihao Zhang;Yijia Chen;
Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many NP-hard problems and also provides a much finer complexity classification for other intractable problems. Although the theory is mostly on decision problems, parameterized complexity naturally extends to counting problems as well. The purpose of this article is to survey a few aspects of parameterized counting complexity, with a particular emphasis on some general frameworks in which parameterized complexity proves to be indispensable.
2014年04期 v.19 410-420页 [查看摘要][在线阅读][下载 254K] [下载次数：20 ] |[网刊下载次数：0 ] |[引用频次：4 ] |[阅读次数：0 ]