Parameterized Algorithms

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

Full description

Main Authors: Cygan, Marek, Fomin, Fedor V. (Author), Kowalik, Łukasz (Author), Lokshtanov, Daniel (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2015, 2015
Edition:1st ed. 2015
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02792nmm a2200325 u 4500
001 EB001085568
003 EBX01000000000000000844932
005 00000000000000.0
007 cr|||||||||||||||||||||
008 151215 ||| eng
020 |a 9783319212753 
100 1 |a Cygan, Marek 
245 0 0 |a Parameterized Algorithms  |h Elektronische Ressource  |c by Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh 
250 |a 1st ed. 2015 
260 |a Cham  |b Springer International Publishing  |c 2015, 2015 
300 |a XVII, 613 p. 84 illus., 25 illus. in color  |b online resource 
505 0 |a 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 
653 |a Algorithms 
653 |a Algorithms 
653 |a Algorithm Analysis and Problem Complexity 
700 1 |a Fomin, Fedor V.  |e [author] 
700 1 |a Kowalik, Łukasz  |e [author] 
700 1 |a Lokshtanov, Daniel  |e [author] 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
856 |u https://doi.org/10.1007/978-3-319-21275-3?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.1 
520 |a 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