A Guide to Algorithm Design

Paradigms, Methods, and Complexity Analysis

Anne Benoit, Yves Robert, Frédéric Vivien (Autoren)

Buch | Hardcover

380 Seiten

2013
Crc Press Inc (Verlag)
978-1-4398-2564-8 (ISBN)

Artikel merken

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.

Yves Robert, École Normale Supérieure de Lyon, Institut Universitaire de France, and Université de Lyon, France Anne Benoit and Frederic Vivien, École Normale Supérieure de Lyon, France

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.

Reihe/Serie	Chapman & Hall/CRC Applied Algorithms and Data Structures series
Zusatzinfo	71 Illustrations, black and white
Verlagsort	Bosa Roca
Sprache	englisch
Maße	156 x 234 mm
Gewicht	657 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
ISBN-10	1-4398-2564-5 / 1439825645
ISBN-13	978-1-4398-2564-8 / 9781439825648
Zustand	Neuware