MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02184nam a22003017a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
IIITD |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20241104103744.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
180625s2019 enk b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781107057760 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
IIITD |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.7 |
| Item number |
FOM-K |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Kernelization : |
| Remainder of title |
theory of parameterized preprocessing |
| Statement of responsibility, etc |
by Fedor V. Fomin...[et al.]. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Cambridge : |
| Name of publisher, distributor, etc |
Cambridge University Press, |
| Date of publication, distribution, etc |
©2019 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xiii, 515 p. ; |
| Dimensions |
22 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
1.What Is a Kernel? |
| -- |
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 |
| -- |
14.Introduction to Treewidth |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
"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"-- |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Electronic data processing |
| General subdivision |
Data preparation. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Data reduction. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Kernel functions. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Parameter estimation. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Fomin, Fedor V. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Lokshtanov, Daniel |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Saurabh, Saket |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Zehavi, Meirav |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Books |
