Algorithm design Jon Kleinberg, Éva Tardos.
Material type: TextPublication details: Noida Pearson India Education Service Pvt. Ltd. 2014Description: 824pISBN:- 9789332518643 (alk. paper)
- 005.1 K673A 23
Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Books | Central Library, IISER Bhopal General Section | 005.1 K673A (Browse shelf(Opens below)) | Available | 8133 | ||||
Books | Central Library, IISER Bhopal General Section | 005.1 K673A (Browse shelf(Opens below)) | Available | 8132 | ||||
Books | Central Library, IISER Bhopal General Section | 005.1 K673A (Browse shelf(Opens below)) | Available | 8130 | ||||
Books | Central Library, IISER Bhopal General Section | 005.1 K673A (Browse shelf(Opens below)) | Available | 8131 | ||||
Books | Central Library, IISER Bhopal Reference Section | Reference | 005.1 K673A (Browse shelf(Opens below)) | Not For Loan | Reserve | 8128 | ||
Books | Central Library, IISER Bhopal Reference Section | Reference | 005.1 K673A (Browse shelf(Opens below)) | Not For Loan | Reserve | 8129 |
Browsing Central Library, IISER Bhopal shelves, Shelving location: General Section Close shelf browser (Hides shelf browser)
005.1 H426I Interactive Markov chains and the quest for quantified quality | 005.1 K673A Algorithm design | 005.1 K673A Algorithm design | 005.1 K673A Algorithm design | 005.1 K673A Algorithm design | 005.1 K786A2 Art of computer programming: | 005.1 K786A2 Art of computer programming: |
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.
There are no comments on this title.