Introduction to the Design And Analysis of Algorithms A Strategic Approach R.C.T Lee,S.S Tseng,R.C Chang,et.al english
Material type:
- 978-1-25-902582-2
- 23 518.1 LEE
Contents:
Preface
1 Introduction
2 The complexity of algorithms and the lower bounds of problems
3 The greedy method
4 The divide-and-conquer strategy
5 Tree searching strategies
6 Prune-and-search
7 Dynamic programming
8 The theory of NP-completeness
9 Approximation algorithms
10 Amortized analysis
11 Randomized algorithms
12 On-line algorithms
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
![]() |
Tetso College Library Science and Technology | Non-fiction | 518.1 LEE (Browse shelf(Opens below)) | Available | 10488 |
Preface
1 Introduction
2 The complexity of algorithms and the lower bounds of problems
3 The greedy method
4 The divide-and-conquer strategy
5 Tree searching strategies
6 Prune-and-search
7 Dynamic programming
8 The theory of NP-completeness
9 Approximation algorithms
10 Amortized analysis
11 Randomized algorithms
12 On-line algorithms
There are no comments on this title.
Log in to your account to post a comment.