Algorithms illuminated (part 3) : greedy algorithms and dynamic programming
Publication details: San Francisco : Soundlikeyourself Publishing, ©2019Description: xi, 217 p. : ill. ; 23 cmISBN:- 9780999282946
- 005.73 ROU-A
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | Course reserves |
|---|---|---|---|---|---|---|---|---|
Books
|
IIITD General Stacks | Computer Science and Engineering | 005.73 ROU-A (Browse shelf(Opens below)) | Available | 013185 | |||
|
Books
|
IIITD Reference | Computer Science and Engineering | REF 005.73 ROU-A (Browse shelf(Opens below)) | Not for loan | 013186 |
Analysis and Design of Algorithms (Sec A & B) UG (SEM IV) WNT25 |
Browsing IIITD shelves, Shelving location: Reference, Collection: Computer Science and Engineering Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| REF 005.73 LIP-D Schaum's outline of theory and problems of data structures | REF 005.73 ROU-A Algorithms illuminated (part 1) : the basics | REF 005.73 ROU-A Algorithms illuminated (part 2) : graph algorithms and data structures | REF 005.73 ROU-A Algorithms illuminated (part 3) : greedy algorithms and dynamic programming | REF 005.73 SAM-F Foundations of multidimensional and metric data structures | REF 005.73 WEI-D Data structures and algorithm analysis in C++ | REF 005.73 WEI-D Data structures and algorithms analysis in C |
Includes index
13. Introduction to greedy algorithms
14. Huffman codes
15. Minimum spanning trees
16. Introduction to dynamic programming
17. Advance dynamic programming
18. Shortest paths revisited
There are no comments on this title.