Abstract
The parameterized computational complexity of a collection of well-known problems including: BANDWIDTH, PRECEDENCE CONSTRAINED MULTIPROCESSOR SCHEDULING, LONGEST COMMON SUBSEQUENCE, DNA PHYSICAL MAPPING (or INTERNALIZING COLORED GRAPHS), PERFECT PHYLOGENY (or TRIANGULATING COLORED GRAPHS), COLORED CUTWIDTH, and FEASIBLE REGISTER ASSIGNMENT is explored. It is shown that these problems are hard for various levels of the W hierarchy. In the case of PRECEDENCE CONSTRAINED MULTIPROCESSOR SCHEDULING the results can be interpreted as providing substantial new complexity lower bounds on the outcome of [OPEN 8] of the Garey and Johnson list.
Cite
CITATION STYLE
Bodlaender, H. L., Fellows, M. R., & Hallett, M. T. (1994). Beyond NP-Completeness for Problems of Bounded Width: Hardness for the W Hierarchy (Extended Abstract). In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129502, pp. 449–458). Association for Computing Machinery. https://doi.org/10.1145/195058.195229
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
