| 000 | 01148cam a22002414a 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20191001155445.0 | ||
| 008 | 050106s2006 ii a g b 001 0 eng | ||
| 020 | _a9788131703106 (pbk) | ||
| 040 |
_cNCL _dNIF2019 |
||
| 042 | _apcc | ||
| 082 | 0 | 0 |
_a005.1 _bKLE-A 2006 2914 |
| 100 | 1 | _aKleinberg, Jon. | |
| 245 | 1 |
_aAlgorithm design / _cby Jon Kleinberg, Éva Tardos. |
|
| 260 |
_aNew Delhi : _bPearson/Addison-Wesley, _cc2006. |
||
| 300 |
_axxiii, 838 p. : _bill. ; _c24 cm. |
||
| 504 | _aIncludes bibliographical references (p. [805]-814) and index. | ||
| 505 | 0 | _a1.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 14. Epilogue: algorithms that run forever. | |
| 650 | 0 | _aComputer algorithms. | |
| 650 | 0 | _aData structures (Computer science) | |
| 700 | 1 | _aTardos, Éva. | |
| 942 |
_2ddc _cBK |
||
| 999 |
_c2430 _d2430 |
||