Abstract
In this chapter, we study how the powerful paradigm of randomization can help in designing FTP algorithms. We introduce the general techniques of color coding, divide and color, and chromatic coding, and show the use of these techniques on the problems Longest Path and d-Clustering. We discuss also how these randomized algorithms can be derandomized using standard techniques.
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). Randomized Methods in Parameterized Algorithms. In: Parameterized Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-21275-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-21275-3_5
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)