000 01469cam a22003254a 4500
001 13832914
003 OSt
005 20161220114706.0
008 050106s2006 maua b 001 0 eng
010 _a 2005000401
020 _a9789332518643 (alk. paper)
040 _aIISER Bhopal
_cSBA ( Recommended by Dr. Pawan k Aurora)
042 _apcc
082 0 0 _a005.1 K673A
_223
100 1 _aKleinberg, Jon.
_918152
222 _aEECS
222 _aEECS Collection
222 _aComputer
222 _aComputer Algorithm
245 1 0 _aAlgorithm design
_cJon Kleinberg, Éva Tardos.
260 _aNoida
_bPearson India Education Service Pvt. Ltd.
_c2014
300 _a824p
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.
_918153
650 0 _aData structures (Computer science)
_918154
700 1 _aTardos, Éva.
_918155
942 _2ddc
_cBK
999 _c7717
_d7717