LEADER 01768nam a2200301 i 4500
001 991001153119707536
008 050611s2006    maua     b    001 0 eng d
020   $a0321295358
035   $ab13328530-39ule_inst
040   $aDip.to Ingegneria dell'Innovazione$beng
082 0 $a005.1$222
100 1 $aKleinberg, Jon$0598658
245 10$aAlgorithm design /$cJon Kleinberg, Éva Tardos
260   $aBoston [etc] :$bPearson/Addison-Wesley,$cc2006
300   $axxiii, 838 p. :$bill. ;$c24 cm
504   $aIncludes bibliographical references and index
505 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.
650  4$aComputer algorithms
650  4$aData structures (Computer science)
700 1 $aTardos, Éva$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0433592
856 41$3Table of contents$uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html$zTable of contents
907   $a.b13328530$b08-09-21$c14-07-05
912   $a991001153119707536
945   $aLE026 005.1 D KLE 01.01 C.1 2006$cC.1$g1$i2026000023779$lle026$nProf. Cafaro / Biblioteca$op$pE65.95$q-$rn$s-  $t1$u0$v0$w0$x0$y.i14132412$z04-10-05
945   $aLE026 005.1 D KLE 01.01 C.2 2006$cC.2$g1$i2026000023878$lle026$nProf. Cafaro / Biblioteca$op$pE88.95$q-$rl$s-  $t4$u6$v3$w6$x0$y.i14123198$z07-09-05
996   $aAlgorithm design$91028082
997   $aUNISALENTO
998   $ale026$b11-06-05$cm$da  $e-$feng$gmau$h0$i0