000			01490cam a22003134a 4500
999			_c770 _d770
001			13832914
003			OSt
005			20200910101317.0
008			050106s2006 maua b 001 0 eng
010			_a 2005000401
020			_a9789332518643
040			_aDLC _cDLC _dDLC
042			_apcc
050	0	0	_aQA76.9.A43 _bK54 2006
082	0	0	_a510.5 _bKLE
100	1		_aKleinberg, Jon.
245	1	0	_aAlgorithm design / _cJon Kleinberg, Éva Tardos.
260			_aBoston : _bPearson/Addison-Wesley, _cc2006.
300			_axxiii, 838 p. : _bill. ; _c24 cm.
505	0		_tIntroduction: Some representative problems -- _tBasics of algorithms analysis -- _tGraphs -- _tGreedy algorithms -- _tDivide and conquer -- _tDynamic programming -- _tNetwork flow -- _tNP and computational intractability -- _tPSPACE: A class of problems beyond NP -- _tExtending the limits of tractability -- _tApproximation algorithms -- _tLocal search -- _tRandomized algorithms -- _tEpilogue: algorithms that run forever.
650		0	_aComputer algorithms.
650		0	_aData structures (Computer science)
700	1		_aTardos, Éva.
942			_2ddc _cBK
504			_aIncludes bibliographical references (p. [805]-814) and index.
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg