## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Anne Benoit; Yves Robert; Frédéric Vivien |

ISBN: | 9781439825648 1439825645 |

OCLC Number: | 757931613 |

Description: | xvii, 362 pages : illustrations ; 24 cm. |

Contents: | Polynomial-Time Algorithms: Exercises Introduction to Complexity On the complexity to compute xnAsymptotic notations: O, o, Î , and â ¦Divide-and-Conquer Strassen's algorithm Master theorem Solving recurrencesGreedy Algorithms Motivating example: the sports hall Designing greedy algorithms Graph coloringTheory of matroidsDynamic Programming The coin changing problem The knapsack problem Designing dynamic-programming algorithmsAmortized AnalysisMethods for amortized analysisExercises, Solutions, and Bibliographic Notes appear at the end of each chapter in this section.NP-Completeness and Beyond NP-Completeness A practical approach to complexity theory Problem classesNP-complete problems and reduction theory Examples of NP-complete problems and reductionsImportance of problem definition Strong NP-completeness Why does it matter?Exercises on NP-Completeness Easy reductionsAbout graph coloringScheduling problemsMore involved reductions2-PARTITION is NP-completeBeyond NP-Completeness Approximation resultsPolynomial problem instancesLinear programmingRandomized algorithms Branch-and-bound and backtrackingExercises Going beyond NP-Completeness Approximation resultsDealing with NP-complete problemsReasoning on Problem Complexity Reasoning to Assess a Problem Complexity Basic reasoning Set of problems with polynomial-time algorithms Set of NP-complete problems Chains-on-Chains Partitioning Optimal algorithms for homogeneous resources Variants of the problem Extension to a clique of heterogeneous resourcesConclusionReplica Placement in Tree Networks Access policies Complexity resultsVariants of the replica placement problem ConclusionPacket Routing MEDP: Maximum edge-disjoint pathsPRVP: Packet routing with variable-pathsConclusionMatrix Product, or Tiling the Unit Square Problem motivation NP-completeness A guaranteed heuristicRelated problemsOnline Scheduling Flow time optimization Competitive analysisMakespan optimizationConclusionBibliographyIndex |

Series Title: | Chapman & Hall/CRC applied algorithms and data structures series. |

Responsibility: | by Anne Benoit, Yves Robert and Frederick Raoul Vivien. |

## Reviews

*Editorial reviews*

Publisher Synopsis

"This well-written book takes a fresh look at a classical subject, with features that will please both instructors and students. The book provides an insightful introduction to algorithm design with detailed coverage of a broad range of topics. The nice selection of exercises and the well-chosen case studies will be very useful for teachers of undergraduate courses. The sections devoted to the methodology of algorithm design should help students acquire a deeper understanding of advanced notions in complexity theory and approximation. A really nice job in both scope and style!"-Denis Trystram, Distinguished Professor, Grenoble Institute of Technology"Graduate students and instructors alike will find this book an invaluable resource. The subject matter is presented following a logical progression that makes students understand not only the principles behind algorithm design and analysis, but also the raison d'etre and the practical relevance of these principles. And yet, the book can also be used as a compendium of knowledge that provides the practitioner a quiver of algorithmic arrows. Finally, the extensive sets of motivating examples and exercises will prove instrumental for any instructor willing to develop an engaging course on advanced algorithms."-Henri Casanova, Associate Professor, Department of Information and Computer Sciences, University of Hawai'i at Manoa"This book is a great technical arsenal for every graduate student and post-graduate researcher. By providing a treasure trove of concrete algorithmic examples, the book trains the reader to recognize clues that indicate the complexity of a broad range of algorithmic problems, while supplying a battery of techniques for solving a particular problem in hand. The book is also a true source of inspiration for instructors looking for a material to teach advanced algorithms courses."-Umit Catalyurek, Professor, Ohio State University"This book is unique among texts on algorithmics in its emphasis on how to `think algorithmically' rather than just how to solve specific (classes of) algorithmic problems. The authors skillfully engage the reader in a journey of algorithmic self-discovery as they cover a broad spectrum of issues, from the very basic (computing powers, coin changing) through the quite advanced (NP-completeness, polynomial-time approximation schemes). The authors emphasize algorithmic topics that have proven useful in `applied' situations ... . I shall be very happy to have this text on my bookshelf as a reference on methods as well as results."-Arnold L. Rosenberg, Research Professor, Northeastern University, and Distinguished University Professor Emeritus, University of Massachusetts Amherst"This book presents a well-balanced approach to theory and algorithms and introduces difficult concepts using rich motivating examples. It demonstrates the applicability of fundamental principles and analysis techniques to practical problems facing computer scientists and engineers. You do not have to be a theoretician to enjoy and learn from this book."-Rami Melhem, Professor of Computer Science, University of Pittsburgh Read more...

*User-contributed reviews*