Tag: fixed-parameter-tractable

Found 36 results for 'fixed-parameter-tractable'.

1) graph-algorithms - Exact Algorithms for r-Dominating Set on Bounded Treewidth Graphs
2) reference-request - Nonstandard dual parametrization of graph problems
3) sat - Complexity of SAT parameterized by treewidth
4) counting-complexity - Is it known whether counting $q$-dimensional $p$-matching is $\#W[1]$-Hard?
5) ds.algorithms - Variants of Cluster-Vertex-Deletion problem
6) graph-theory - Given a 4-cycle free graph $G$, can we determine if it has a 3-cycle in quadratic time?
7) graph-algorithms - Node-weighted steiner problem with few terminals
8) cc.complexity-theory - On Random Self-reducible properties
9) cc.complexity-theory - Easy decision hard counting Parametrized
10) graph-isomorphism - Open problems related to Graph isomorphism
11) ds.algorithms - W[1]-hard problems with FPT time approximation algorithms
12) parameterized-complexity - Complement problems are not in the same class in parametrized complexity hierarchy? If not in $P$
13) parameterized-complexity - Natural maximization problems in FPT
14) parameterized-complexity - Reducing Parameterized Problems (whose solution size can be "large") to W[i]-complete problems (for fixed i)
15) parameterized-complexity - Proving membership in W-hierarchy when problem is not parameterized by its solution size
16) cc.complexity-theory - Parametrized complexity of the 2-Long Paths Problem
17) ds.algorithms - Algebraic formulation for packing problem
18) cc.complexity-theory - Relation between fixed parameter and approximation algorithm
19) cc.complexity-theory - Fixed parameter tractable Integer Programming and $FPP$
20) cc.complexity-theory - Complexity of k-clique for hypergraphs
21) cc.complexity-theory - What is the motivation behind the definition of fixed parameter tractability?
22) parameterized-complexity - Polynomial kernel for $k$-FLIP SAT on $3$-CNF formulas
23) np-hardness - On integer programming
24) cc.complexity-theory - DFSA and NFSA intersection problem
25) parameterized-complexity - Any results on binary boolean CSP beyond the fixed-parameter tractability of almost 2SAT problem?
26) time-complexity - What is a natural problem in theory of computation?
27) ds.algorithms - Parameterized algorithm when the parameter is not known in advance?
28) parameterized-complexity - Reducing Parameterized Problems (whose solution size can be "large") to W[i]-complete problems (for fixed i)
29) ds.algorithms - Vertex disjoint simple paths of length k
30) cc.complexity-theory - Is parametrized maximum independent clauses problem in FPT?
31) graph-algorithms - What is the best known FPT result for 3-hitting set?
32) ds.algorithms - Best parameterized algorithm for maximum clique
33) cc.complexity-theory - Consequences of faster parameterized integer programming
34) complexity-classes - Conjecture: All FPT NP-complete languages are fixed-parameter-isomorphic
35) graph-theory - Is there FPT or XP algorithms knowm for Shortest Steiner cycle and $(a,b)$-Steiner path problem
36) ds.algorithms - Maximize a special monotone submodular function - is it easier?