Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt.

Parameterized Algorithms

Langbeschreibung
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.
Inhaltsverzeichnis
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.
Dr. Marek Cygan is an assistant professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include fixed parameter tractability, approximation algorithms, and exact exponential algorithms.
ISBN-13:
9783319212753
Veröffentl:
2015
Seiten:
613
Autor:
Marek Cygan
eBook Typ:
PDF
eBook Format:
EPUB
Kopierschutz:
1 - PDF Watermark
Sprache:
Englisch

53,49 €*

Lieferzeit: Sofort lieferbar
Alle Preise inkl. MwSt.