Kernelization: Theory of Parameterized Preprocessing
By: and and and
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2019
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781108577335
- Related ISBNs:
- 9781107057760, 9781107057760
- Publisher:
- Cambridge University Press
- Date of Addition:
- 01/10/19
- Copyrighted By:
- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Fedor V. Fomin
- by Daniel Lokshtanov
- by Saket Saurabh
- by Meirav Zehavi
- in Nonfiction
- in Computers and Internet