Algorithm design
Kleinberg, Jon.
Algorithm design Jon Kleinberg, Éva Tardos. - Noida Pearson India Education Service Pvt. Ltd. 2014 - 824p
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.
9789332518643 (alk. paper) = EECS EECS Collection Computer Computer Algorithm
2005000401
Computer algorithms.
Data structures (Computer science)
005.1 K673A
Algorithm design Jon Kleinberg, Éva Tardos. - Noida Pearson India Education Service Pvt. Ltd. 2014 - 824p
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.
9789332518643 (alk. paper) = EECS EECS Collection Computer Computer Algorithm
2005000401
Computer algorithms.
Data structures (Computer science)
005.1 K673A