from Part II - Concepts and Techniques
Published online by Cambridge University Press: 18 April 2019
In this chapter, we introduce the concepts of parameterized problem and fixed-parameter tractability. Using these concepts, one can show that problems that are polynomial-time intractable in general (i.e., \np-hard) may yet be practically solvable provided only that certain input parameters are constrained in terms of their values. This conception of tractability underlies the FPT-Cognition Thesis introduced in Chapter 1. We illustrate three techniques for showing that a parameterized problem is fixed-parameter tractable, namely, brute-force combinatorics, bounded search trees, and reduction to a problem kernel.We also include several exercises for practicing these techniques.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.