Algorithm design /

By: Kleinberg, JonContributor(s): Tardos, ÉvaMaterial type: TextTextLanguage: English Publication details: Boston : Pearson/Addison-Wesley, c2006Description: xxiii, 838 p. : illISBN: 9788131703106Subject(s): Computer algorithms | Data structures (Computer science) | Computer ScienceOnline resources: Click here to access online
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: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified Status Date due Barcode
IMSc Library
IMSc Library
681.3.02 KLE (Browse shelf (Opens below)) Available 74145

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.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha