Księgarnia naukowa
English Polski
On-line access

Bookstore

0.00 PLN
Bookshelf (0) 
Your bookshelf is empty
Free access during pandemic


Kernelization: Theory of Parameterized Preprocessing

Kernelization: Theory of Parameterized Preprocessing

Authors
Publisher Cambridge University Press
Year 10/01/2019
Pages 528
Version hardback
Readership level Professional and scholarly
ISBN 9781107057760
Categories Algorithms & data structures, Databases
$97.42 (with VAT)
365.00 PLN / €80.26 / £71.42
Qty:
Delivery to United States

check shipping prices
Product to order
Delivery 14 days
Add to bookshelf

Book 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.

Kernelization: Theory of Parameterized Preprocessing

Table of contents

1. What is a kernel?; Part I. Upper Bounds: 2. Warm up; 3. Inductive priorities; 4. Crown decomposition; 5. Expansion lemma; 6. Linear programming; 7. Hypertrees; 8. Sunflower lemma; 9. Modules; 10. Matroids; 11. Representative families; 12. Greedy packing; 13. Euler's formula; Part II. Meta Theorems: 14. Introduction to treewidth; 15. Bidimensionality and protrusions; 16. Surgery on graphs; Part III. Lower Bounds: 17. Framework; 18. Instance selectors; 19. Polynomial parameter transformation; 20. Polynomial lower bounds; 21. Extending distillation; Part IV. Beyond Kernelization: 22. Turing kernelization; 23. Lossy kernelization.

We also recommend books

Strony www Białystok Warszawa
801 777 223