This chapter shows how to use the well-known dynamic programming technique in order to design fixed-parameter algorithms. More specifically, dynamic programming solutions are presented for problems such as Knapsack, Steiner Problem in Graphs, tree-structured variants of Set Cover, and others. In a final discussion, the relationship to structural problem parameterization is pointed out.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.