Kleinberg, Jon, <br/><br/>
Algorithm design / 
Jon Kleinberg, Éva Tardos. 
 - xxiii, 838 páginas :  ilustraciones ;  24 cm. 
<br/><br/>Incluye bibliografía (p. [805]-814). 
<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: algorithms that run forever. 
<br/><br/><label>ISBN: </label>0321295358 9780321295354 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algoritmos (Computadores).<br/>Estructura de datos (Computadores).
<br/><br/><label>Dewey Class. No.: </label>005.1  / K64a 2006