| Kernelization: Theory of Parameterized Preprocessing (Cambridge University Press) |
| Wednesday, 06 March 2019 | |||
|
Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi, provide an overview of basic methods and important results, with accessible explanations of the most recent advances in the area, such as meta-kernelization, representative sets, polynomial lower bounds, and lossy kernelization. <ASIN:1107057760>
Authors: Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi
The text is divided into four parts, which cover the different theoretical aspects of the area: upper bounds, meta-theorems, lower bounds, and beyond kernelization. The methods are demonstrated through extensive examples using a single data set. For more Book Watch just click. Book Watch is I Programmer's listing of new books and is compiled using publishers' publicity material. It is not to be read as a review where we provide an independent assessment. Some, but by no means all, of the books in Book Watch are eventually reviewed. To have new titles included in Book Watch contact BookWatch@i-programmer.info Follow @bookwatchiprog on Twitter or subscribe to I Programmer's Books RSS feed for each day's new addition to Book Watch and for new reviews.
|