Abstract
In this chapter, we gather a few algorithmic tools that we feel are important, but do not fit into any of the previous chapters. First, we discuss exponentialtime dynamic-programming algorithms that consider all subsets of a certain set when defining the subproblems. Second, we introduce the Integer Linear Programming Feasibility problem, formulate the classical results on how to solve it in the case of a bounded number of variables, and show an example of its application in fixed-parameter algorithms. Finally, we discuss the algorithmic implications of the Robertson-Seymour theorem on graph minors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cygan, M. et al. (2015). Miscellaneous. In: Parameterized Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-21275-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-21275-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21274-6
Online ISBN: 978-3-319-21275-3
eBook Packages: Computer ScienceComputer Science (R0)