01577nam a2200313 i 4500991003696749707536080609s2006 maua b 001 0 eng d0321372913b13738604-39ule_instDip.to Matematicaeng005.122AMS 68M10LC QA76.9.A43K54Kleinberg, Jon598658Algorithm design /Jon Kleinberg, Eva TardosBoston :Pearson/Addison-Wesley,c2006xxiii, 838 p. :ill. ;24 cmIncludes bibliographical references (p. [805]-814) and indexIntroduction: 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 foreverComputer algorithmsData structures (Computer science)Tardos, Evaauthorhttp://id.loc.gov/vocabulary/relators/aut433592Table of contentshttp://www.loc.gov/catdir/toc/ecip056/2005000401.html.b1373860428-01-1409-06-08991003696749707536LE013 68M KLE11 (2006)12013000208077le013pE79.95-l- 08780.i1477825717-06-08Algorithm design1028082UNISALENTOle01309-06-08ma -engmau00