000			01048nam a2200205 4500
008			220602b ||||| |||| 00| 0 eng d
020			_a9789332518643 (pbk.)
082			_a005.1 _bKLE
100			_aKleinberg, Jon _91256
245			_aAlgorithm design
260			_aNoida _bPearson India Education Services Pvt Ltd _c2014
300			_a824p.,
500			_ahttps://www.pearsoned.co.in/web/books/9789332518643_Algorithm-Design_Jon-Kleinberg.aspx
520			_aTable of Content 1. Introduction: Some Representative Problems 2. Basics of Algorithms Analysis 3. Graphs 4. Divide and Conquer 5. Greedy Algorithms 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. Randomized Algorithms 13. Local Search
650			_aComputer algorithms _91528
650			_aData structures - Computer science _91531
650			_aAlgorithms _91133
700			_aTardos, Éva _91532
942			_cBK
999			_c7980 _d7980