| Record ID | marc_miami_univ_ohio/allbibs0185.out:7340588:1337 |
| Source | Miami University of Ohio |
| Download Link | /show-records/marc_miami_univ_ohio/allbibs0185.out:7340588:1337?format=raw |
LEADER: 01337pam 22002774a 4500
001 ocm57422612
005 20051220020824.0
008 050106s2006 maua b 001 0 eng
010 $a2005000401
020 $a0321295358 (alk. paper)
040 $aDLC$cDLC$dIXA$dMUQ$dBAKER$dMIA
042 $apcc
049 $aMIAS
050 00 $aQA76.9.A43$bK54 2006
100 1 $aKleinberg, Jon
245 10 $aAlgorithm design /$cJon Kleinberg, Éva Tardos
260 $aBoston :$bPearson/Addison-Wesley,$cc2006
300 $axxiii, 838 p. :$bill. ;$c24 cm
504 $aIncludes bibliographical references (p. [805]-814) 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 0 $aComputer algorithms
650 0 $aData structures (Computer science)
700 1 $aTardos, Éva
907 $a.b34264711$b10-05-06$c12-20-05
998 $ascl$b12-20-05$cm$da$e-$feng$gmau$h0$i1
945 $aCSA$g1$i35054028325542$j0$lscrs $o-$p$0.00$q-$r-$s-$t8$u11$v2$w0$x0$y.i43597658$z12-20-05