| 000 | 00914 a2200277 4500 | ||
|---|---|---|---|
| 003 | IIITD | ||
| 005 | 20250214020004.0 | ||
| 008 | 250211b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9780999282946 | ||
| 040 | _aIIITD | ||
| 082 |
_a005.73 _bROU-A |
||
| 100 | _aRoughgarden, Tim | ||
| 245 |
_aAlgorithms illuminated (part 3) : _bgreedy algorithms and dynamic programming _cby Tim Roughgarden |
||
| 260 |
_aSan Francisco : _bSoundlikeyourself Publishing, _c©2019 |
||
| 300 |
_axi, 217 p. : _bill. ; _c23 cm. |
||
| 500 | _aIncludes index | ||
| 505 | _t13. Introduction to greedy algorithms | ||
| 505 | _t14. Huffman codes | ||
| 505 | _t15. Minimum spanning trees | ||
| 505 | _t16. Introduction to dynamic programming | ||
| 505 | _t17. Advance dynamic programming | ||
| 505 | _t18. Shortest paths revisited | ||
| 650 | _aComputer algorithms | ||
| 650 | _aComputer programming | ||
| 942 |
_cBK _2ddc _01 |
||
| 999 |
_c189839 _d189839 |
||