000			00900 a2200217 4500
003			OSt
005			20240311162837.0
008			240302b |||||||| |||| 00| 0 eng d
020			_a9789332518643
040			_ccus
082			_a518.1 _bKLE/A
100			_925896 _aKleinberg,Jon
245			_aAlgorithm Design
260			_aIndia: _bPearson, _c2014.
300			_a824p.
505			_a1)Introduction: Some representative problems 2)Basics of algorithms analysis 3)Graphs 4)Greedy algorithms 5)Divide and conquer 6)Dynamic programming 7)Network flow 8)NP and computational intractability 9)PSPACE: A class of problems beyond NP 10)Extending the limits of tractability 11)Approximation algorithms 12)Local search 13)Randomized algorithms
650			_aComputer algorithms _99678
650			_aComputer algorithms Design _925897
700			_aTardos,Éva _925898
942			_2ddc _cWB16
999			_c214059 _d214059