Read Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press

Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press

Fedor V. Fomin

4.9/5 (33230 ratings)

Description: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.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press. To get started finding Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Pages: —

Format: PDF, EPUB & Kindle Edition

Publisher: Cambridge University Press

Release: —

ISBN

Description: 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.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press. To get started finding Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Special Offer | $0.00

Special Offer! | $0.00

Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press

Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Cambridge University Press

More Books

[(Algorithm Theory -- SWAT 2012 )] [Author: Fedor V. Fomin] [Jun-2012]

[(Algorithm Theory -- SWAT 2012 )] [Author: Fedor V. Fomin] [Jun-2012]

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I (Lecture Notes in Computer Science, 7965)

Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I (Lecture Notes in Computer Science, 7965)

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series) by Fedor V. Fomin (2010-10-27)

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series) by Fedor V. Fomin (2010-10-27)

[(Automata, Languages, and Programming: Part II: Proceedings )] [Author: Fedor V. Fomin] [Jul-2013]

[(Automata, Languages, and Programming: Part II: Proceedings )] [Author: Fedor V. Fomin] [Jul-2013]

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series) by Fedor V. Fomin (2012-12-17)

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series) by Fedor V. Fomin (2012-12-17)

[(Exact Exponential Algorithms )] [Author: Fedor V. Fomin] [Dec-2012]

[(Exact Exponential Algorithms )] [Author: Fedor V. Fomin] [Dec-2012]

Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers (Lecture Notes in Computer Science, 4271)

Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers (Lecture Notes in Computer Science, 4271)