Title A Guide to Algorithm Design : Paradigms, Methods, and Complexity Analysis

Published Boca Raton : Chapman and Hall/CRC, 2013

Click on the following:
ProQuest Ebook Central

Copies

Description 1 online resource (382 pages) Series Chapman and Hall/CRC Applied Algorithms and Data Structures Ser. ; v. 6 Chapman and Hall/CRC Applied Algorithms and Data Structures Ser Contents Front Cover; Contents; Preface; I: Polynomial-time algorithms: Exercises; 1. Introduction to complexity; 2. Divide-and-conquer; 3. Greedy algorithms; 4. Dynamic programming; 5. Amortized analysis; II: NP-completeness and beyond; 6. NP-completeness; 7. Exercises on NP-completeness; 8. Beyond NP-completeness; 9. Exercises going beyond NP-completeness; III: Reasoning on problem complexity; 10. Reasoning to assess a problem complexity; 11. Chains-on-chains partitioning; 12. Replica placement in tree networks; 13. Packet routing; 14. Matrix product, or tiling the unit square; 15. Online scheduling Bibliography References Notes Print version record Subject Computational complexity. Computer algorithms. Algorithms. algorithms. Algorithms Computational complexity Computer algorithms Form Electronic book Author Robert, Yves Vivien, édéric ISBN 9781439898130 1439898138

  Permalink