Results 251 to 260 of about 2,616,817 (282)
Fixed-parameter tractability results for feedback set problems in tournaments [PDF]
Journal of Discrete Algorithms, 2010 Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set
Falk Hüffner +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fixed-parameter tractability for the Tree Assembly problem
Theoretical Computer Science, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng Shi 0003 +4 more
openaire +1 more source
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters, 2006 We study an NP-hard (and MaxSNP-hard) problem in trees—Multicommodity Demand Flow—dealing with demand flows between pairs of nodes and trying to maximize the value of the routed flows.
Rolf Niedermeier, Jiong Guo
exaly +1 more source
2009
Parameterized complexity is a new theoretical framework that considers, in addition to the overall input size, the effects on computational complexity of a secondary measurement, the parameter. This two-dimensional viewpoint allows a fine-grained complexity analysis that takes structural properties of problem instances into account.
Samer Marko, Szeider Stefan
openaire +1 more source
Parameterized complexity is a new theoretical framework that considers, in addition to the overall input size, the effects on computational complexity of a secondary measurement, the parameter. This two-dimensional viewpoint allows a fine-grained complexity analysis that takes structural properties of problem instances into account.
Samer Marko, Szeider Stefan
openaire +1 more source
Fixed-Parameter Tractable Reductions to SAT
2014Today’s SAT solvers have an enormous importance and impact in many practical settings. They are used as efficient back-end to solve many NP-complete problems. However, many computational problems are located at the second level of the Polynomial Hierarchy or even higher, and hence polynomial-time transformations to SAT are not possible, unless the ...
Ronald de Haan, Stefan Szeider
openaire +1 more source
Fixed-Parameter Tractability of (n − k) List Coloring
Theory of Computing Systems, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aritra Banik +3 more
openaire +1 more source
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patricia A. Evans +2 more
openaire +3 more sources
On Fixed-Parameter Tractable Parameterizations of SAT
2004We survey and compare parameterizations of the propositional satisfiability problem (SAT) in the framework of Parameterized Complexity (Downey and Fellows, 1999). In particular, we consider (a) parameters based on structural graph decompositions (tree-width, branch-width, and clique-width), (b) a parameter emerging from matching theory (maximum ...
openaire +1 more source
A fixed-parameter tractable algorithm for matrix domination
Information Processing Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
2001We study the parameterized complexity of the problem to reconstruct a binary (evolutionary) tree from a complete set of quartet topologies in the case of a limited number of errors. More precisely, we are given n taxa, exactly one topology for every subset of 4 taxa, and a positive integer k (the parameter). Then, the Minimum Quartet Inconsistency (MQI)
Jens Gramm, Rolf Niedermeier
openaire +2 more sources