Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Closest Substring problem with small distances
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On miniaturized problems in parameterized complexity theory
Theoretical Computer Science - Parameterized and exact computation
Parameterized graph separation problems
Theoretical Computer Science - Parameterized and exact computation
Parameterized coloring problems on chordal graphs
Theoretical Computer Science - Parameterized and exact computation
An exact almost optimal algorithm for target set selection in social networks
Proceedings of the 10th ACM conference on Electronic commerce
On problems without polynomial kernels
Journal of Computer and System Sciences
Pattern Matching for 321-Avoiding Permutations
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Treewidth governs the complexity of target set selection
Discrete Optimization
Subexponential time and fixed-parameter tractability: exploiting the miniaturization mapping
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Based on the framework of parameterized complexitytheory,we derive tight lower bounds on the computationalcomplexity for a number of well-known NP-hard problems.We start by proving a general result, namely that theparameterized weighted satisfiability problem on depth-tcircuits cannot be solved in time n^o(k) poly(m), where nis the circuit input length, m is the circuit size, and kis the parameter, unless the (t - 1)-st level W[t - 1] ofthe W-hierarchy collapses to FPT. By refining this technique,we prove that a group of parameterized NP-hardproblems, including weighted sat, dominating set,hitting set, set cover, and feature set, cannot besolved in time n^o(k) poly(m), where n is the size of theuniversal set from which the k elements are to be selectedand m is the instance size, unless the first level W[1] ofthe W-hierarchy collapses to FPT. We also prove thatanother group of parameterized problems which includesweighted q-sat (for any fixed q 驴 2), clique, and independentset, cannot be solved in time n^o(k) unless allsearch problems in the syntactic class SNP, introduced byPapadimitriou and Yannakakis, are solvable in subexponentialtime. Note that all these parameterized problemshave trivial algorithms of running time either n^k poly(m)or O(n^k).