Algorithm design

By:

Kleinberg, Jon

Contributor(s):

Tardos, Éva

Material type: Text

TextPublication details: Noida Pearson India Education Services Pvt Ltd 2014Description: 824pISBN:

9789332518643 (pbk.)

Subject(s):

DDC classification:

005.1 KLE

Summary: Table of Content 1. Introduction: Some Representative Problems 2. Basics of Algorithms Analysis 3. Graphs 4. Divide and Conquer 5. Greedy Algorithms 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. Randomized Algorithms 13. Local Search

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Book	Plaksha University Library	Computer science	005.1 KLE (Browse shelf(Opens below))	Checked out	01/02/2024	003139
Book	Plaksha University Library	Computer science	005.1 KLE (Browse shelf(Opens below))	Available		003140

https://www.pearsoned.co.in/web/books/9789332518643_Algorithm-Design_Jon-Kleinberg.aspx

Table of Content

1. Introduction: Some Representative Problems
2. Basics of Algorithms Analysis
3. Graphs
4. Divide and Conquer
5. Greedy Algorithms
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. Randomized Algorithms
13. Local Search

There are no comments on this title.

to post a comment.