Algorithm design / Jon Kleinberg, Éva Tardos.
By: Kleinberg, Jon
.
Contributor(s): Tardos, Éva.
Material type: 
TextPublisher: India : Pearson | Dorling Kindersley (India) Pvt. Ltd., c2014. [Fourteenth impression 2017]Description: 824 p. : ill. ; 25 cm.ISBN: 9789332518643.Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1
Contents:
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.
| Item type | Current location | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 1 | Not For Loan | 008526 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 2 | Available | 008527 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 3 | Available | 008528 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 4 | Available | 008529 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 5 | Available | 008530 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 6 | Available | 010348 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 7 | Available | 010349 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 8 | Available | 010350 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 9 | Available | 010351 | |
| Book | BAIUST Library General Stacks | 005.1 K6731a (Browse shelf) | 10 | Available | 010352 |
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.
Computer Science and Engineering
There are no comments for this item.