Amazon cover image
Image from Amazon.com

Algorithm design / Jon Kleinberg, Éva Tardos.

By: Contributor(s): Publication details: Boston ; New Delhi : Pearson/Addison-Wesley, c2006.Description: xxiii, 838 p. : ill. ; 24 cmISBN:
  • 9788131703106
  • 0321295358 (alk. paper)
Subject(s): DDC classification:
  • 005.1 22
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.
List(s) this item appears in: Computer Club (BUCC) Programming Training for ACM related Contests
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode Item holds
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.1 KLE (Browse shelf(Opens below)) 1 Missing 3010021079
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.1 KLE (Browse shelf(Opens below)) 2 Checked out 28/04/2024 3010021080
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.1 KLE (Browse shelf(Opens below)) 3 Available 3010021081
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.1 KLE (Browse shelf(Opens below)) 4 Missing 3010021082
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.1 KLE (Browse shelf(Opens below)) 5 Checked out 05/05/2024 3010021083
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.1 KLE (Browse shelf(Opens below)) 6 Available 3010021707
Book Book Ayesha Abed Library Special Section Ayesha Abed Library Special Section 005.1 KLE (Browse shelf(Opens below)) 7 Damaged 3010017891
Total holds: 0

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.

to post a comment.
Share