000			01238cam a22002774a 4500
001			4692
003			BD-DhEU
005			20190305150840.0
008			020815s20062014ii a b 001 0 eng
020			_a9789332518643
040			_aDLC _cDLC _dDLC _dBD-DhEU
041			_aeng
082	0	0	_a005.1 _223 _bKLA 2014
100	1		_aKleinberg, Jon.
245	1	0	_aAlgorithm design / _cJon Kleinberg, Éva Tardos.
260			_aNew Delhi : _bPearson/Addison-Wesley, _cc2014.
300			_a824p. : _bill. ; _c25 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.
590			_aAH
650		0	_aComputer algorithms.
650		0	_aData structures (Computer science)
700	1		_aTardos, Éva.
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html
942			_2ddc _cBK _01
999			_c4629 _d4629