North South University Library OPAC

Amazon cover image
Image from Amazon.com

Algorithm design / Jon Kleinberg and Éva Tardos.

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Boston : Pearson, c2006.Description: xxiii, 838 p. : ill. ; 24 cmISBN:
  • 0321372913
Subject(s): DDC classification:
  • 005.1 K64a
LOC classification:
  • QA76.9 .A43K54 2006
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.
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 Collection Shelving location Call number Copy number Status Date due Barcode
Books Books North South University Library Non-fiction General Stacks QA76.9.A43K54 2006 (Browse shelf(Opens below)) 1 Available 27031
Books Books North South University Library Non-fiction QA76.9.A43K54 2006 (Browse shelf(Opens below)) 2 Available 27090
Browsing North South University Library shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)
QA76.76.T48A46 2017 Introduction to software testing / QA76.76.W56B37 1993 Programning Windows games with Borland C++ / QA76.87.O83 2000 Oscillations in neural systems / QA76.9.A43K54 2006 Algorithm design / QA76.9.A43S43 2011 Algorithms / QA76.9.A43S43 2011 Algorithms / QA76.9.A73M36 1993 Computer system architecture /

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.

Mathematics, Physics and Statistics

Sumaiya Kainat Bintey Kohinoor

There are no comments on this title.

to post a comment.
© 2017-2024 NSU Library
North South University

Powered by Koha