W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications
نویسندگان
چکیده
The notion of linear fpt-reductions has been recently used to derive strong computational lower bounds for well-known NP-hard problems. In this paper, we formally investigate the notions of W [t]-hardness and W [t]-completeness under the linear fpt-reduction, and study structural properties of the corresponding complexity classes. Additional complexity lower bounds on important computational problems are also es-
منابع مشابه
Using the PCP in proving Fixed parameter inapproximability
A problem P is (r, t)-FPT-inapproximable if the problem admits no r(k) approximation that runs in time t(k) · n for a constant c. We deal with hardness of approximation of setcover and clique. A feature of our scheme is that we only use k = opt(I) for some instance I, and so the hardness in k directly implies (r(opt(I)), t(opt(I)))hardness. The way Fixed Parameter hardness was proved. before ou...
متن کاملAn investigation on Mechanical Properties of Apatite-Wollastonite-Diopside Glass-Ceramics Composites
Apatite-wollastonite (A-W)-phlogopite glass-ceramic is considered to be difficult to resorb, but often, it has been incorporated in particulate form to create new bioactive composites for potential maxillofacial applications. With various compositions, the present work has attempted to prepare apatite-wollastonite (A-W)-phlogopite glass ceramic composites, by applying sintering. Here, three-poi...
متن کاملUsing the PCP to prove fixed parameter hardness
For a minimization (resp, maximization) problem P , and a parameter k, an algorithm is called a (r(k), t(k))-FPT-approximation algorithm, if for an instance I of size n with optimum opt, the algorithm either computes a feasible solution for I, with value at most k · r(k) (resp, at least k/r(k)) or it computes a certificate that k < opt (resp, k > opt), in time t(k) · poly(n). For maximization p...
متن کاملUsing the PCP for proving Fixed parameter inapproximability
For a minimization (resp, maximization) problem P , and a parameter k, an algorithm is called an (r(k), t(k))-FPT-approximation algorithm, if for an instance I of size n with optimum opt, the algorithm either computes a feasible solution for I, with value at most k · r(k) (resp, at least k/r(k)) or it computes a certi cate that k < opt (resp, k > opt), in time t(k) · poly(n). For maximization p...
متن کاملDefensive Alliances in Graphs of Bounded Treewidth
A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time algorithms if certain parameters are bounded by a fixed constant. In particular, fixed-parameter tractability results have been obtained for some structural p...
متن کامل