| 000 | 01528cam a22003254a 4500 | ||
|---|---|---|---|
| 999 |
_c527005 _d527005 |
||
| 001 | 13832914 | ||
| 003 | NUST | ||
| 005 | 20190718071737.0 | ||
| 008 | 050106s2006 maua b 001 0 eng | ||
| 010 | _a 2005000401 | ||
| 020 | _a0321295358 (alk. paper) | ||
| 038 | _aArshad | ||
| 040 |
_aDLC _cDLC _dDLC |
||
| 042 | _apcc | ||
| 050 | 0 | 0 |
_aQA76.9.A43 _bK54 2006 |
| 082 | 0 | 0 |
_a005.1 _bKLE |
| 100 | 1 |
_aKleinberg, Jon. _918061 |
|
| 245 | 1 | 0 |
_aAlgorithm design / _cJon Kleinberg, Éva Tardos. |
| 260 |
_aBoston : _bPearson/Addison-Wesley, _c2006. |
||
| 300 |
_axxiii, 838 p. : _bill. ; _c24 cm. |
||
| 504 | _aIncludes bibliographical references (p. [805]-814) and index. | ||
| 505 | 0 | _aIntroduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever. | |
| 650 | 0 |
_aComputer algorithms. _93009 |
|
| 650 | 0 |
_aData structures (Computer science) _93010 |
|
| 700 | 1 |
_aTardos, Éva. _918062 |
|
| 856 | 4 | 1 |
_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html |
| 906 |
_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg |
||
| 942 |
_2ddc _cBK |
||