01768nam a2200301 i 4500991001153119707536050611s2006 maua b 001 0 eng d0321295358b13328530-39ule_instDip.to Ingegneria dell'Innovazioneeng005.122Kleinberg, Jon598658Algorithm design /Jon Kleinberg, Éva TardosBoston [etc] :Pearson/Addison-Wesley,c2006xxiii, 838 p. :ill. ;24 cmIncludes bibliographical references 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 forever.Computer algorithmsData structures (Computer science)Tardos, Évaauthorhttp://id.loc.gov/vocabulary/relators/aut433592Table of contentshttp://www.loc.gov/catdir/toc/ecip056/2005000401.htmlTable of contents.b1332853008-09-2114-07-05991001153119707536LE026 005.1 D KLE 01.01 C.1 2006C.112026000023779le026Prof. Cafaro / BibliotecapE65.95-n- 10000.i1413241204-10-05LE026 005.1 D KLE 01.01 C.2 2006C.212026000023878le026Prof. Cafaro / BibliotecapE88.95-l- 46360.i1412319807-09-05Algorithm design1028082UNISALENTOle02611-06-05ma -engmau00