000			01212nam a2200265 a 4500
001			13832914
008			100927r2006 maua b 001 0 eng d
010			_a 2005000401
020			_a9788131703106
020			_a0321295358 (alk. paper)
040			_aDLC _cDLC _dDLC _dBD-DhAAL
082	0	0	_a005.1 _222
100	1		_aKleinberg, Jon.
245	1	0	_aAlgorithm design / _cJon Kleinberg, Éva Tardos.
260			_aBoston ; _aNew Delhi : _bPearson/Addison-Wesley, _cc2006.
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.
650		0	_aData structures (Computer science)
700	1		_aTardos, Éva.
942	0	0	_01
999			_c9563 _d9563