Kleinberg, Jon. <br/><br/>
Algorithm design / 
Jon Kleinberg, Éva Tardos. 
 - Boston :  Pearson ;  Addison-Wesley,  2006. 
 - 838 p. :  il. grafs., ejemps., etc ;. 
<br/><br/>Incluye referencias bibliográficas, índice , etc. 
<br/><br/> Introduction: 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 --  Reference --  Indix.  Cap.  1.  2.  3.  4.  5.  6.  7.  8.  9.  10.  11.  12.  13. 
<br/><br/><label>ISBN: </label>0321295358  (pasta dura) 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer Algorithms<br/>Algoritmos<br/>Data Structures (Computer Science)<br/>Estructura de Datos (Computadores)
<br/><br/><label>Dewey Class. No.: </label>005.1  / K64