Anne Benoit, Yves Robert, Frédéric Vivien

A Guide to Algorithm Design

Paradigms, Methods, and Complexity Analysis

• Gebundenes Buch

Produktbeschreibung

Providing a comprehensive set of problem studies that builds on the authors' expertise and class-tested material, this useful manual offers a guided exploration of methods and techniques to assess problem complexity in the study and design of algorithms.

---

Presenting a complementary perspective to standard books on algorithms, A Guide to Algorithm Design 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. 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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis
• Seitenzahl: 380
• Erscheinungstermin: 27. August 2013
• Englisch
• Abmessung: 239mm x 160mm x 18mm
• Gewicht: 458g
• ISBN-13: 9781439825648
• ISBN-10: 1439825645
• Artikelnr.: 34382146

Autorenporträt

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

Inhaltsangabe

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.