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

A Guide to Algorithm Design (eBook, ePUB)

Paradigms, Methods, and Complexity Analysis

• Format: ePub

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis eBooks
• Seitenzahl: 380
• Erscheinungstermin: 27. August 2013
• Englisch
• ISBN-13: 9780429644115
• Artikelnr.: 72518474

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.