01260cam a22002774a 450000100090000000300060000900500170001500800410003201000170007302000180009004000200010804200080012805000250013608200190016110000200018024500530020026000460025330000360029950000180033550400660035350504030041965000250082265000390084770000190088685600770090513832914GCWUF20171204093314.0050106s2006    maua     b    001 0 eng    a  2005000401  a9789332518643  aMAINcDLCdMAIN  apcc00aQA76.9.A43bK54 200600a005.1222bKLE1 aKleinberg, Jon.10aAlgorithm design /cJon Kleinberg, Éva Tardos.  aBoston :bPearson/Addison-Wesley,cc2006.  axxiii, 838 p. :bill. ;c24 cm.  aInclude Index  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