Bounded fixed-parameter tractability and reducibility
نویسندگان
چکیده
منابع مشابه
Bounded fixed-parameter tractability and reducibility
We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some familyF . For every family F of functions, this yields a notion of F -fixed parameter tractability. If F is the class of all polynomially bounded functions, then F -fixed parameter tractability coincides wit...
متن کاملFixed Parameter Tractability and Treewidth 14 . 1 Fixed Parameter Tractability
One of the ways to cope with hard problems in practice is to realized that problem instances may be associated with some “parameters” related to their complexity. If the parameter of an instance is small, we might have some hope in finding a polynomial time solution to that instance. This idea has been investigated in the 1990’s by Downian and Fellowes in their work on fixed parameter tractabil...
متن کاملBounded Fixed-Parameter Tractability and log2n Nondeterministic Bits
Motivated by recent results showing that there are natural parameterized problems that are fixed-parameter tractable, but can only be solved by fixed-parameter tractable algorithms the running time of which depends non-elementarily on the parameter, we propose a notion of bounded fixed-parameter tractability, where the dependence of the running time on the parameter is restricted to be singly e...
متن کاملFixed Parameter Tractability and Completeness
For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-Dominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as k-Feedback Vertex Set, exhibit fixed-parameter tractability: for each fixed k the problem is solvable in time bounded by a polynomial of degree c, where c is a const...
متن کاملScheduling Meets Fixed-Parameter Tractability
Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems. In this paper we present the first fixed-parameter algorithms for cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2007
ISSN: 0168-0072
DOI: 10.1016/j.apal.2007.06.001