On the complexity of fixed parameter problems
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 210-215
- https://doi.org/10.1109/sfcs.1989.63480
Abstract
The authors address the question of why some fixed-parameter problem families solvable in polynomial time seem to be harder than others with respect to fixed-parameter tractability: whether there is a constant alpha such that all problems in the family are solvable in time O(n/sup alpha /). The question is modeled by considering a class of polynomially indexed relations. The main results show that (1) this setting supports notions of completeness that can be used to explain the apparent hardness of certain problems with respect to fixed-parameter tractability, and (2) some natural problems are complete.Keywords
This publication has 4 references indexed in Scilit:
- Optimization, approximation, and complexity classesPublished by Association for Computing Machinery (ACM) ,1988
- The complexity of optimization problemsPublished by Association for Computing Machinery (ACM) ,1986
- Disjoint Paths—A SurveySIAM Journal on Algebraic Discrete Methods, 1985
- The complexity of facets resolvedPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985