Kernelization - Theory of Parameterized Preprocessing (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	2019
Authors:	Fedor V. Fomin • Daniel Lokshtanov • Saket Saurabh • Meirav Zehavi
Dimensions:	235 x 157 x 31mm (L x W x T)
Format:	Hardcover
Pages:	528
ISBN-13:	978-1-107-05776-0
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Applications of computing > Databases > General Promotions
LSN:	1-107-05776-0
Barcode:	9781107057760

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!