Algorithm design /
by Kleinberg, Jon.
Item type | Current location | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
![]() |
University of Sargodha-Central Library | 005.1 KLA (Browse shelf) | Available | 94378 | |
![]() |
University of Sargodha-Central Library | 005.1 KLA (Browse shelf) | Available | 93579 | |
![]() |
Hall D | 005.1 KLA (Browse shelf) | Available | 94041 |
Includes bibliographical references 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 for this item.