Introduction to the Design And Analysis of Algorithms A Strategic Approach
Lee R.C.T
Introduction to the Design And Analysis of Algorithms A Strategic Approach english R.C.T Lee,S.S Tseng,R.C Chang,et.al - New Delhi Tata McGraw Hill Education Pvt Ltd 2012 - 723p. ; Soft bound 18*24 cm
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
978-1-25-902582-2
518.1 / LEE
Introduction to the Design And Analysis of Algorithms A Strategic Approach english R.C.T Lee,S.S Tseng,R.C Chang,et.al - New Delhi Tata McGraw Hill Education Pvt Ltd 2012 - 723p. ; Soft bound 18*24 cm
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
978-1-25-902582-2
518.1 / LEE