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

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

ISBN 10: 1439825645 / ISBN 13: 9781439825648

Published by CRC Press, 2013

About this Item

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Seller Inventory # S_470616503

Bibliographic Details

• Title: A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
• Publisher: CRC Press
• Publication Date: 2013
• Language: English
• ISBN 10: 1439825645
• ISBN 13: 9781439825648
• Binding: hardcover
• Condition: Good

About this title

Synopsis

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.

About the Author

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