You might also like

More about Parameterized Algorithms

• Book details
• Synopsis
• Trending among others

You get 200 loyalty points

Book synopsis

This book introduces the reader to the field of parameterized algorithms and complexity and explains some of the most recent tools and techniques in the area in a comprehensive, coherent manner. It is organized into three parts. The first seven chapters give the basic toolbox of parameterized algorithms. The second part, consisting of five chapters, covers more advanced algorithmic techniques that feature prominently in current research, such as important separators and algebraic methods. The third part introduces the reader to the theory of lower bounds: the intractability theory of parameterized complexity, lower bounds based on the exponential time hypothesis, and lower bounds on kernels.§§The authors are experienced educators and every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. The book is appropriate for graduate students and advanced undergraduate students.§

Book details

Book category Books in English Mathematics & science Mathematics Calculus & mathematical analysis

• Full title: Parameterized Algorithms
• Author: Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk
• Language: English
• Binding: Hardback
• Number of pages: 613
• EAN: 9783319212746
• ISBN: 3319212745
• ID: 09366213
• Publisher: Springer International Publishing AG
• Weight: 1064 g
• Dimensions: 164 × 242 × 46 mm
• Date of publishing: 23. July 2015

Trending among others

---

---

---