Algorithm design /
Kleinberg, Jon.
Algorithm design / Jon Kleinberg, Éva Tardos. - Boston ; New Delhi : Pearson/Addison-Wesley, c2006. - xxiii, 838 p. : ill. ; 24 cm.
Includes bibliographical references (p. [805]-814) and index.
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.
9788131703106 0321295358 (alk. paper)
2005000401
005.1
Algorithm design / Jon Kleinberg, Éva Tardos. - Boston ; New Delhi : Pearson/Addison-Wesley, c2006. - xxiii, 838 p. : ill. ; 24 cm.
Includes bibliographical references (p. [805]-814) and index.
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.
9788131703106 0321295358 (alk. paper)
2005000401
005.1