Filters








3,441 Hits in 4.5 sec

Parameterized algorithms of fundamental NP-hard problems: a survey

Wenjun Li, Yang Ding, Yongjie Yang, R. Simon Sherratt, Jong Hyuk Park, Jin Wang
2020 Human-Centric Computing and Information Sciences  
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  ...  In this paper, we are focused on the algorithms' main idea and algorithmic techniques, and omit the details of them.  ...  Acknowledgements The authors would like to thank the reviewers for their valuable comments which improve the quality of this paper dramatically.  ... 
doi:10.1186/s13673-020-00226-w fatcat:2ncywbdlnrdtzliiz4tyi76df4

A Survey on the k-Path Vertex Cover Problem [article]

Jianhua Tu
2022 arXiv   pre-print
In this paper, we present a brief survey of the current state of the art in the study of the k-path vertex cover problem and the k-path vertex cover number.  ...  In the k-path vertex cover problem, it is required to find a minimum k-path vertex cover in a given graph.  ...  Acknowledgments The work was supported by Research Foundation for Advanced Talents of Beijing Technology and Business University (No. 19008021187).  ... 
arXiv:2201.03397v2 fatcat:v5caz3jmcjcxzhia2476odhy4a

Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey [article]

G. Gutin, A. Yeo
2011 arXiv   pre-print
We discuss results, both polynomial kernels and parameterized algorithms, obtained for the problems mainly in the last few years as well as some open questions.  ...  We also consider Max-r-CSP-AA, a natural generalization of both Max-r-Lin2-AA and Max-r-Sat-AA, order (or, permutation) constraint satisfaction problems of arities 2 and 3 parameterized above the average  ...  Introduction This paper surveys mainly recent results in a subarea of parameterized algorithms and complexity that was launched quite early in the short history of parameterized algorithms and complexity  ... 
arXiv:1108.4803v1 fatcat:3wxkx7blgjfkzmqtw4jn7qdlqa

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey [chapter]

Gregory Gutin, Anders Yeo
2012 Lecture Notes in Computer Science  
We discuss results, both polynomial kernels and parameterized algorithms, obtained for the problems mainly in the last few years as well as some open questions.  ...  We also consider Max-r-CSP-AA, a natural generalization of both Max-r-Lin2-AA and Max-r-Sat-AA, order (or, permutation) constraint satisfaction problems of arities 2 and 3 parameterized above the average  ...  Introduction This paper surveys mainly recent results in a subarea of parameterized algorithms and complexity that was launched quite early in the short history of parameterized algorithms and complexity  ... 
doi:10.1007/978-3-642-30891-8_14 fatcat:r6ztg5kqybefhfxd2myyxtbq6q

Distributed Constraint Optimization Problems and Applications: A Survey

Ferdinando Fioretto, Enrico Pontelli, William Yeoh
2018 The Journal of Artificial Intelligence Research  
This survey provides an overview of the DCOP model, offering a classification of its multiple extensions and addressing both resolution methods and applications that find a natural mapping within each  ...  structure of the specific problem.  ...  The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the sponsoring organizations  ... 
doi:10.1613/jair.5565 fatcat:zeou5gji5fas3h27ab4jxvtwkq

A Survey on Workflow Satisfiability, Resiliency, and Related Problems [article]

Daniel Ricardo dos Santos, Silvio Ranise
2017 arXiv   pre-print
The WSP is inherently hard, but solutions to this problem have a practical application in reconciling business compliance and business continuity.  ...  In this paper, we survey the work done on these problems in the past 20 years.  ...  Many hard problems become less complex if some natural parameter of the instance is bounded.  ... 
arXiv:1706.07205v1 fatcat:r54f5z6ykvaojpleu6cjwqtmni

A survey of parameterized algorithms and the complexity of edge modification [article]

Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
2020 arXiv   pre-print
The survey provides an overview of the developing area of parameterized algorithms for graph modification problems.  ...  We concentrate on edge modification problems, where the task is to change a small number of adjacencies in a graph in order to satisfy some required property.  ...  All the corresponding modification problems are shown to be NP-hard when s ≥ 1 (s ≥ 2 in the case of completion), W[1]-hard when parameterized by k and FPT parameterized by (s, k).  ... 
arXiv:2001.06867v2 fatcat:6ogysat6n5drpbxsvs63zjmega

A Survey on the Complexity of Flood-Filling Games [chapter]

Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 Lecture Notes in Computer Science  
The Flood-It problem on trees and the Restricted Shortest Common Supersequence (RSCS) problem are analogous. Flood-It remains NP-hard when played on 3-colored trees.  ...  We review a recent investigation of the parameterized complexity of Flood-It when the size of a minimum vertex cover is the structural parameter.  ...  [d]-Flood-It on trees remains NP-hard when d = 2. The proof of Theorem 8 uses a reduction from the Vertex Cover Problem.  ... 
doi:10.1007/978-3-319-98355-4_20 fatcat:2fxb6b5f7jdgxkiwbeei3ytsxe

Distances between phylogenetic trees: A survey

Feng Shi, Qilong Feng, Jianer Chen, Lusheng Wang, Jianxin Wang
2013 Tsinghua Science and Technology  
In this paper, we give a survey on the aspects of computational complexity, fixed-parameter algorithms, and approximation algorithms for computing the TBR and SPR distances of phylogenetic trees.  ...  Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species.  ...  Acknowledgements This work was supported by the National Natural Science Foundation of China (Nos. 61103033, 61173051, 61232001, and 70921001).  ... 
doi:10.1109/tst.2013.6616522 fatcat:tl6wrac7arfjlpce4jijenfbxe

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020 Algorithms  
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.  ...  We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/a13060146 fatcat:2u2vv3uksfguvj6473t2gsq42a

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms [article]

Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020 arXiv   pre-print
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.  ...  We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
arXiv:2006.04411v1 fatcat:hjgu7f3s7zbydkcnioq3qlzgza

A Survey of Learning Causality with Data: Problems and Methods [article]

Ruocheng Guo, Lu Cheng, Jundong Li, P. Richard Hahn, Huan Liu
2019 arXiv   pre-print
This survey aims to close the gap between big data and learning causality with a comprehensive and structured review of traditional and frontier methods and a discussion about some open problems of learning  ...  At the end, some open problems are presented to show the great potential of learning causality with data.  ...  Searching for the causal graph with maximal score, also known as structural learning is both NP-hard and NP-complete [27, 29] .  ... 
arXiv:1809.09337v3 fatcat:zq5hmgg345haxir2b6poq36yla

Deep Model-Based Reinforcement Learning for High-Dimensional Problems, a Survey [article]

Aske Plaat, Walter Kosters, Mike Preuss
2020 arXiv   pre-print
We use these approaches to organize a comprehensive overview of important recent developments such as latent models.  ...  In this paper, we survey the contemporary model-based landscape. First we discuss definitions and relations to other fields.  ...  ACKNOWLEDGMENTS We thank the members of the Leiden Reinforcement Learning Group, and especially Thomas Moerland and Mike Huisman, for many discussions and insights.  ... 
arXiv:2008.05598v2 fatcat:5xmwmemv5bfinkw57avf5ghhxq

A Survey on Influence Maximization in a Social Network [article]

Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar
2018 arXiv   pre-print
Hence, there is a need for an organized and comprehensive review on this topic. This paper presents a survey on the progress in and around TSS Problem.  ...  This problem is known as Target Set Selection in a social network (TSS Problem) and more popularly, Social Influence Maximization Problem (SIM Problem).  ...  Theorem 1. [36] Social Influence Maximization Problem is NP-Hard for both IC as well as LT model and also NP-Hard to approximate within a factor of n (1− ) ∀ > 0.  ... 
arXiv:1808.05502v1 fatcat:3n7abvpufng7nptkdnm2fb5uqi

Static output feedback—A survey

V.L. Syrmos, C.T. Abdallah, P. Dorato, K. Grigoriadis
1997 Automatica  
It includes analytical and computational methods and presents in a uni ed fashion, the knowledge gained in the decades of research i n to this most important problem.  ...  This paper reviews the static output feedback problem in the control of linear, time-invariant LTI systems.  ...  Grigoriadis acknowledges the nancial support of a University of Houston PEER Award.  ... 
doi:10.1016/s0005-1098(96)00141-0 fatcat:qcacyudxqjaszfhwk6zlgbfwiu
« Previous Showing results 1 — 15 out of 3,441 results