000 | 00900nam a2200169Ia 4500 | ||
---|---|---|---|
020 | _a8173716129 | ||
082 |
_a005.1 _bHOR |
||
100 | _aHorowitz, Ellis & others | ||
245 | _aFundamentals of computer algorithms | ||
250 | _aEd.2 | ||
260 |
_aHyderabad _bUniversities Press (India) Ltd. _c2010 |
||
300 | _axx,773,xip. | ||
500 | _aCONTENTS Preface v 1 Introduction 1 2 Elementary Data Structures 79 3 Divide and Conquer 136 4 The Greedy Method 210 5 Dynamic Programming 272 6 Basic Traversal and Search Techniques 333 7 Backtracking 359 8 Branch and Bound 399 9 Algebraic Problems 436 10 Lower Bound Theory 476 11 NP-Hard and NP-Complete Problems514 12 Approximation Algorithms 576 13 Pram Algorithms 623 14 Mesh Algorithms 683 15 Hypercube Algorithms 738 Index I-1 | ||
890 | _aIndia | ||
891 | _aSchool of Building Science & Technology, CEPT Uni. | ||
999 |
_c12234 _d12234 |