Algorithm design / by Jon Kleinberg, Éva Tardos.

By: Kleinberg, Jon
Contributor(s): Tardos, Éva
Material type: TextTextPublisher: New Delhi : Pearson/Addison-Wesley, c2006Description: xxiii, 838 p. : ill. ; 24 cmISBN: 9788131703106 (pbk)Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1
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 14. Epilogue: algorithms that run forever.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
Books Books Namal Library
Computer Science
005.1 KLE-A 2006 2914 (Browse shelf) Available 0002914
Total holds: 0

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
14. Epilogue: algorithms that run forever.

There are no comments for this item.

to post a comment.