01520cam a22003254a 4500999001900000001000900019003000500028005001700033008004100050010001700091020002800108038001100136040001800147042000800165050002500173082001500198100002700213245005300240260004500293300003600338504006600374505040300440650003100843650004500874700002600919856007700945906004501022942001201067952011501079  c527005d52700513832914NUST20190718071737.0050106s2006    maua     b    001 0 eng    a  2005000401  a0321295358 (alk. paper)  aArshad  aDLCcDLCdDLC  apcc00aQA76.9.A43bK54 200600a005.1bKLE1 aKleinberg, Jon.91806110aAlgorithm design /cJon Kleinberg, Éva Tardos.  aBoston :bPearson/Addison-Wesley,c2006.  axxiii, 838 p. :bill. ;c24 cm.  aIncludes bibliographical references (p. [805]-814) and index.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. 0aComputer algorithms.93009 0aData structures (Computer science)930101 aTardos, Éva.918062413Table of contentsuhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html  a7bcbccorignewd1eecipf20gy-gencatlg  2ddccBK  00102ddc4070aNQCbNQCcCARTd2019-07-18ePurchasedg0.00l0o005.1 KLEpQ-6r2019-07-18t1w2019-07-18yBK