Parameterized computation theory has developed rapidly over the last two decades. In theoretical computer science, it has attracted considerable attention for its theoretical value and significant guidance in many practical applications. We give an overview on parameterized algorithms for some fundamental NP-hard problems, including MaxSAT, Maximum Internal Spanning Trees, Maximum Internal Out-Branching, Planar (Connected) Dominating Set, Feedback Vertex Set, Hyperplane Cover, Vertex Cover, Packing and Matching problems. All of these problems have been widely applied in various areas, such as Internet of Things, Wireless Sensor Networks, Artificial Intelligence, Bioinformatics, Big Data, and so on. In this paper, we are focused on the algorithms’ main idea and algorithmic techniques, and omit the details of them.

中文翻译：

---

基本NP难问题的参数化算法：调查

在过去的二十年中，参数化计算理论得到了迅速发展。在理论计算机科学中，它的理论价值和在许多实际应用中的重要指导已经引起了相当大的关注。我们概述了一些基本的NP困难问题的参数化算法，包括MaxSAT，最大内部生成树，最大内部分支，平面（连接的）支配集，反馈顶点集，超平面覆盖，顶点覆盖，打包和匹配问题。所有这些问题已广泛应用于各个领域，例如物联网，无线传感器网络，人工智能，生物信息学，大数据等。在本文中，我们专注于算法的主要思想和算法技术，并省略了它们的细节。