Algorithm Design
Publication details: India: Pearson, 2014Description: 824pISBN: 9789332518643Subject(s): Computer algorithms | Computer algorithms DesignDDC classification: 518.1
Contents:
1)Introduction: Some representative problems
2)Basics of algorithms 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 | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
![]() |
Central Library, Sikkim University General Book Section | 518.1 KLE/A (Browse shelf(Opens below)) | Available | 052847 |
Total holds: 0
Browsing Central Library, Sikkim University shelves, Shelving location: General Book Section Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
518 SCH/S Schaum`s outlines numerical analysis/ | 518.1 DOW/A Algorithmic randomness and complexity/ | 518.1 HES/N Nodal discontinuous Galerkin methods: algorithms, analysis and applications/ | 518.1 KLE/A Algorithm Design | 518.1 LOE/ Triangulations :/ | 518.1 SHE/ Algorithms and programming: problems and solutions/ | 518.1 TOS/D Domain decomposition methods--algorithms and theory/ |
1)Introduction: Some representative problems
2)Basics of algorithms 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.