Algorithm design / Jon Kleinberg & Eva Tardos
Material type:
TextPublication details: India : Pearson, 2018Description: 824 pISBN: - 9789332518643 (pbk)
- 005.1 K6731
Contents:
basics of algorithm analysis
graphs
divide and conquer
greedy algorithms
dynamic programming
network flow
np and computational intractability
PSPACE: a class of problems beyond np
extending the limit of tractability
approximation algorithms
randomized algorithms
local search
epilogue: algorithms that run forever
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Books
|
UE-Central Library | 005.1 K6731 (Browse shelf(Opens below)) | Available | T12578 |
Browsing UE-Central Library shelves Close shelf browser (Hides shelf browser)
| 005.1 H8931 Software project management / | 005.1 H8931 Software project management / | 005.1 K2914 Software engineering : a concise study | 005.1 K6731 Algorithm design | 005.1 K748 The art of computer programming / | 005.1 L5792 Introduction to the design & analysis of algorithms | 005.1 N6918 Introduction to computer programming |
basics of algorithm analysis
graphs
divide and conquer
greedy algorithms
dynamic programming
network flow
np and computational intractability
PSPACE: a class of problems beyond np
extending the limit of tractability
approximation algorithms
randomized algorithms
local search
epilogue: algorithms that run forever
There are no comments on this title.
Log in to your account to post a comment.
