Algorithm design
Material type: TextPublication details: London: Pearson Education Inc [c2006]Description: 824 pISBN: 9789332518643LOC classification: QA76.9.A43
Contents:
1. Introduction: Some Representative Problems
2. Basics of Algorithm 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
Item type | Current library | Collection | Shelving location | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|---|
Book | ICTS | Mathematic | Rack No 3 | QA76.9.A43 (Browse shelf (Opens below)) | Available | Billno:94840; Billdate: 2016-07-06 | 00242 |
Total holds: 0
1. Introduction: Some Representative Problems
2. Basics of Algorithm 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
There are no comments on this title.