| 000 | 01156nac a22002051u 4500 | ||
|---|---|---|---|
| 020 | _a0321295358 (alk. paper) | ||
| 082 |
_a005.1 _bK645 |
||
| 090 |
_c570 _d570 |
||
| 100 | _aKleinberg, Jon. | ||
| 245 |
_aAlgorithm design / _cJon Kleinberg, Éva Tardos. |
||
| 260 |
_aLondon : _bPearson/Addison-Wesley,2006 _cc2006. |
||
| 300 |
_axxiii, 838 p. : _bill. ; _c24 cm. |
||
| 504 | _aIncludes bibliographical references (p. [805]-814) and index. | ||
| 505 | 0 | _antroduction: 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 | _aComputer algorithms. | ||
| 650 | _aData structures (Computer science) | ||
| 700 | 1 | _aTardos, Éva. | |
| 942 |
_cBB _k005.1K645 |
||
| 999 |
_c570 _d570 |
||