E-Book, Englisch, 380 Seiten
Reihe: Chapman & Hall/CRC Applied Algorithms and Data Structures series
Benoit / Robert / Vivien A Guide to Algorithm Design
1. Auflage 2013
ISBN: 978-1-4398-9813-0
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
Paradigms, Methods, and Complexity Analysis
E-Book, Englisch, 380 Seiten
Reihe: Chapman & Hall/CRC Applied Algorithms and Data Structures series
ISBN: 978-1-4398-9813-0
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
Presenting a complementary perspective to standard books on algorithms, A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis provides a roadmap for readers to determine the difficulty of an algorithmic problem by finding an optimal solution or proving complexity results. It gives a practical treatment of algorithmic complexity and guides readers in solving algorithmic problems.
Divided into three parts, the book offers a comprehensive set of problems with solutions as well as in-depth case studies that demonstrate how to assess the complexity of a new problem.
- Part I helps readers understand the main design principles and design efficient algorithms.
- Part II covers polynomial reductions from NP-complete problems and approaches that go beyond NP-completeness.
- Part III supplies readers with tools and techniques to evaluate problem complexity, including how to determine which instances are polynomial and which are NP-hard.
Drawing on the authors’ classroom-tested material, this text takes readers step by step through the concepts and methods for analyzing algorithmic complexity. Through many problems and detailed examples, readers can investigate polynomial-time algorithms and NP-completeness and beyond.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Polynomial-Time Algorithms: Exercises: Introduction to Complexity. Divide-and-Conquer. Greedy Algorithms. Dynamic Programming. Amortized Analysis. NP-Completeness and Beyond: NP-Completeness. Exercises on NP-Completeness. Beyond NP-Completeness. Exercises Going beyond NP-Completeness. Reasoning on Problem Complexity: Reasoning to Assess a Problem Complexity. Chains-on-Chains Partitioning. Replica Placement in Tree Networks. Packet Routing. Matrix Product, or Tiling the Unit Square. Online Scheduling. Bibliography. Index.
