FEEDBACK Smiley face
Normal view MARC view ISBD view

Algorithm design

By: Kleinberg, Jon.
Contributor(s): Tardos, Eva.
Material type: materialTypeLabelBookPublisher: Boston : Pearson Education, ©2006Description: xxiii, 838 p. : ill. ; 24 cm.ISBN: 9788131703106.Subject(s): Computer algorithms | Data structures (Computer science)Online resources: Table of contents
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. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Notes Date due Barcode Item holds Course reserves
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Checked out 28/05/2018 G00652
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available G00538
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available G00462
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available G00191
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available 000435
Books Books IIITD
Reference
Computer Science and Engineering REF 005.1 KLE-A (Browse shelf) Not For Loan 000436

Algorithm Design & Analysis Winter

Algorithms in Computation Biology Monsoon

Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available 000437
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available 000438
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Checked out 31/05/2018 000439
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available 000440
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available 000441
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available 000442
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available 000443
Books Books IIITD
General Stacks
Computer Science and Engineering 005.1 KLE-A (Browse shelf) Available Not Available 000444
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 for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in