TY  - BOOK
AU  - Kleinberg,Jon
AU  - Tardos,Éva
TI  - Algorithm design
SN  - 9789332518643
U1  - 005.1 23
PY  - 2014///
CY  - New Delhi
PB  - Pearson/Addison-Wesley
KW  - Computer algorithms
KW  - Data structures (Computer science)
N1  - 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
UR  - http://www.loc.gov/catdir/toc/ecip056/2005000401.html
ER  -