gogogo
Syndetics cover image
Image from Syndetics

Algorithm design / Jon Kleinberg, Éva Tardos

Contributor(s): Material type: TextTextSeries: Pearson international editionPublication details: Boston : Pearson/Addison-Wesley, ©2006Description: 823 p. : ill. ; 24 cmISBN:
  • 9781292023946
Subject(s): DDC classification:
  • 005.1 KLE
Contents:
1: Introduction: Some representative problems; 2: Basics of algorithms analysis; 3: Graphs; 4: Greedy algorithms; 5: Divide and conquer; 6: Dynamic programming; 7: Network flow; 8: NP and computational intractability; 9: PSPACE: A class of problems beyond NP; 10: Extending the limits of tractability; 11: Approximation algorithms; 12: Local search; 13: Randomized algorithms; Epilogue: algorithms that run forever
Summary: Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Standard Loan Moylish Library Main Collection 005.1 KLE (Browse shelf(Opens below)) 1 Available 39002100625483

Enhanced descriptions from Syndetics:

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Includes bibliographical references (p. [805]-814) and index

1: Introduction: Some representative problems; 2: Basics of algorithms analysis; 3: Graphs; 4: Greedy algorithms; 5: Divide and conquer; 6: Dynamic programming; 7: Network flow; 8: NP and computational intractability; 9: PSPACE: A class of problems beyond NP; 10: Extending the limits of tractability; 11: Approximation algorithms; 12: Local search; 13: Randomized algorithms; Epilogue: algorithms that run forever

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Powered by Koha