Algorithms

by Dasgupta, Sanjoy; Papadimitriou, Christos H.; Vazirani, Umesh

• ISBN13: 9780073523408
• ISBN10: 0073523402
• eBook ISBN(s): 9780077388492
• Edition: 1st
• Format: Paperback
• Copyright: 2006-09-13
• Publisher: McGraw Hill
• More Book Details

Summary

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal.Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center."Algorithmsis an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University

Table of Contents

Prologue

Algorithms with Numbers

Divide-and-conquer algorithms

Decompositions of graphs

Paths in graphs

Greedy algorithms

Dynamic Programming

Linear Programming and Reductions

NP-complete Problems

Coping with NP-completeness

Quantum Algorithms

Table of Contents provided by Publisher. All Rights Reserved.