Beyond NP-Completeness for Problems of BoundedWidth : Hardness for the W Hierarchy ( Extended Abstract )

@inproceedings{Bodlaender1994BeyondNF,
  title={Beyond NP-Completeness for Problems of BoundedWidth : Hardness for the W Hierarchy ( Extended Abstract )},
  author={Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett},
  year={1994}
}
The parameterized computational complexity of a collection of well-known problems including: Bandwidth, Precedence constrained k-processor scheduling, Longest Common Subsequence, DNA physical mapping (or Intervalizing 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 k-processor scheduling the… CONTINUE READING

Similar Papers

Loading similar papers…