01255cam a22002774a 450000100090000000300050000900500170001400800410003101000170007202000280008903800110011704000180012804200080014605000250015408200150017910000200019424500530021426000450026730000360031250400660034850504030041465000250081765000390084270000190088185600770090013832914NUST20190718071737.0050106s2006    maua     b    001 0 eng    a  2005000401  a0321295358 (alk. paper)  aArshad  aDLCcDLCdDLC  apcc00aQA76.9.A43bK54 200600a005.1bKLE1 aKleinberg, Jon.10aAlgorithm 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. 0aData structures (Computer science)1 aTardos, Éva.413Table of contentsuhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html