On Two Techniques of Combining Branching and Treewidth

  title={On Two Techniques of Combining Branching and Treewidth},
  author={Fedor V. Fomin and Serge Gaspers and Saket Saurabh and Alexey A. Stepanov},
Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately exponential time exact algorithms for NP hard problems. In this paper we discuss the efficiency of simple algorithms based on combinations of these techniques. The idea behind these algorithms is very natural: If a parameter like the treewidth of a graph is small, algorithms based on dynamic programming perform well. On the other side, if the… CONTINUE READING

Similar Papers

Loading similar papers…