000 01202nam a22002537a 4500
001 sulb0067455
003 BD-SySUS
005 20180521115049.0
008 180521s2014 ii a b 001 0 engd
020 _a9789332518643
040 _aDLC
_cDLC
_dDLC
_dBD-SySUS
082 0 0 _a005.1
_222
_bKLA
100 1 _aKleinberg, Jon.
_929041
245 1 0 _aAlgorithm design /
_cJon Kleinberg, �Eva Tardos.
260 _aIndia:
_bPearson,
_cc2014.
300 _a824 p. :
_bill. ;
_c24 cm.
504 _aIncludes bibliographical references 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.
_929042
650 0 _aData structures (Computer science)
_929043
700 1 _aTardos, �Eva.
_929044
856 4 1 _3Table of contents
_uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html
942 _2ddc
_cBK
999 _c73110
_d73110