عنوان

Parameterized algorithms /

(Number (ISBN

3319212753

(Number (ISBN

9783319212753

Erroneous ISBN

9783319212746

Number

dltt

Title Proper

Parameterized algorithms /

General Material Designation

[Book]

First Statement of Responsibility

Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh

Specific Material Designation and Extent of Item

1 online resource (xvii, 613 pages) :

Other Physical Details

illustrations (some color)

Text of Note

Includes bibliographical references and indexes

Text of Note

Introduction -- Kernelization -- Bounded Search Trees -- Iterative Compression -- Randomized Methods in Parameterized Algorithms -- Miscellaneous -- Treewidth -- Finding Cuts and Separators -- Advanced Kernelization Algorithms -- Algebraic Techniques: Sieves, Convolutions, and Polynomials -- Improving Dynamic Programming on Tree Decompositions -- Matroids -- Fixed-Parameter Intractability -- Lower Bounds Based on the Exponential-Time Hypothesis -- Lower Bounds for Kernelization

0

Text of Note

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work

Computer algorithms.

Computer science-- Mathematics.

Parameter estimation.

Algorithms.

Computer Science.

COM051300

UMB

Number

Edition

Class number

Book number

Cygan, Marek,1984-

Fomin, Fedor V.

Kowalik, Łukasz

Lokshtanov, Daniel,1984-

Marx, Dániel,1977-

Pilipczuk, Marcin

Pilipczuk, Michał

Saurabh, Saket

Ohio Library and Information Network.

Date of Transaction

20150814093724.7

Cataloguing Rules (Descriptive Conventions))

pn

Electronic name

[Book]

Y