Get Free Shipping on orders over $79
Kernelization : Theory of Parameterized Preprocessing - Fedor V. Fomin

Kernelization

Theory of Parameterized Preprocessing

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

eText | 10 January 2019

At a Glance

eText


$98.95

or 4 interest-free payments of $24.74 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

More in Algorithms & Data Structures

Addiction by Design : Machine Gambling in Las Vegas - Natasha Dow Schüll

eBOOK