000			01139cam a2200253 4500
001			u27097
003			KWAREICT
005			20210913065458.0
008			141209n2006 vp a b 001 0 eng u
020			_a9780321372918
035			_a(Kwareict) u27097
040			_cKwareTech
082	0	4	_a005.1 K J A 221
100	1		_aKleinberg, Jon.
245	1	2	_aAlgorithm design / _cJon Kleinberg, Éva Tardos.
260			_aBoston, Mass. ; _aLondon : _bPearson/Addison-Wesley, _c2006.
300			_axxiii, 838 p. : _bill. ; _c24 cm.
504			_a Includes bibliographical references (p. [805]-814) and index.
505	0		_aSome 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	4	_aComputer algorithms.
650	0	4	_aData structures (Computer science)
700	1		_aTardos, Éva.
942			_2ddc _cBOOK
999			_c4317 _d4317