A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

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

ISBN 10: 1439825645 / ISBN 13: 9781439825648

Edité par CRC Press, 2013

A propos de cet article

N° de réf. du vendeur i5 1;

Détails bibliographiques

Titre : A Guide to Algorithm Design: Paradigms, ...

Éditeur : CRC Press

Date d'édition : 2013

Reliure : Hardcover

Etat : Fine

Edition : 1st Edition

A propos de ce titre

Synopsis :

Book by Benoit Anne Robert Yves Vivien Frdric

Présentation de l'éditeur:

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.