Results 221 to 230 of about 4,614 (253)

Fixed-Parameter Tractable Reductions to SAT

2014
Today’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 Anonymizing Data by Suppressing Entries

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patricia A. Evans, Todd Wareham, Rhonda Chaytor   +2 more
openaire   +2 more sources

Fixed-Parameter Tractability of (n − k) List Coloring

Theory of Computing Systems, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman 0001   +3 more
openaire   +1 more source

On Fixed-Parameter Tractable Parameterizations of SAT

2004
We 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, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Minimum Quartet Inconsistency Is Fixed Parameter Tractable

2001
We 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   +1 more source

Sparse Integer Programming Is Fixed-Parameter Tractable

Mathematics of Operations Research
We study the general integer programming problem where the number of variables n is a variable part of the input. We consider two natural parameters of the constraint matrix A: its numeric measure a and its sparsity measure d. We present an algorithm for solving integer programming in time [Formula: see text], where g is some computable function of ...
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn   +5 more
openaire   +2 more sources

Fixed-Parameter Tractable Generalizations of Cluster Editing

2006
In the Cluster Editing problem, a graph has to be changed to a disjoint union of cliques by at most k edge insertions or deletions. Several reasons suggest a generalized problem where the target graph can have some overlapping cliques. We show that the problem remains fixed-parameter tractable (FPT) in the combination of both parameters: k and a second
openaire   +1 more source

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability

Theoretical Computer Science, 2021
Tesshu Hanaka, Yusuke Kobayashi, Yasuaki Kobayashi   +2 more
exaly  

Fixed-Parameter Tractability, A Prehistory,

2012
openaire   +1 more source