Due to international delivery delays we cannot guarantee delivery of international orders prior to Xmas.   

Kernelization - pr_35740


Theory of Parameterized Preprocessing

By Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi



Or 4 payments of $35.28 with

delivery message Free delivery for orders over $49.99

Add to Wish List
Delivered in 10 - 14 days
Available for Click and Collect
Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors 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. 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. Written to be self-contained, the book only requires a basic background in algorithmics and will be of use to professionals, researchers and graduate students in theoretical computer science, optimization, combinatorics, and related fields.

Product code: 9781107057760

ISBN 9781107057760
Publisher Cambridge University Press
No. Of Pages 528
Dimensions (HxWxD in mm) H235xW157xS31
This self-contained introduction to kernelization, a rapidly developing area of preprocessing analysis, is for researchers, professionals, and graduate students in computer science and optimization. It includes recent advances in upper and lower bounds and meta-theorems, and demonstrates methods through extensive examples using a single data set.