Amazon cover image
Image from Amazon.com

Algorithm design / Jon Kleinberg, Éva Tardos.

By: Contributor(s): Material type: TextTextPublication details: Boston : Pearson/Addison-Wesley, c2006.Description: xxiii, 838 p. : ill. ; 24 cmISBN:
  • 9789332518643
Subject(s): DDC classification:
  • 510.5  KLE
LOC classification:
  • QA76.9.A43 K54 2006
Online resources:
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: New Arrivals Oct-Nov 2021 - Central Library IIITDMK
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 Call number Status Date due Barcode
Books Books IIITDM Kurnool Non-fiction 510.5 KLE (Browse shelf(Opens below)) Available 0003765
Books Books IIITDM Kurnool Non-fiction 510.5 KLE (Browse shelf(Opens below)) Available 0003766
Books Books IIITDM Kurnool Non-fiction 510.5 KLE (Browse shelf(Opens below)) Available 0003767
Books Books IIITDM Kurnool Non-fiction 510.5 KLE (Browse shelf(Opens below)) Available 0003768
Reference Reference IIITDM Kurnool Reference Reference 510.5 KLE (Browse shelf(Opens below)) Reference 0003769
Books Books IIITDM Kurnool General Stacks 510.5 KLE (Browse shelf(Opens below)) Available 0001509
Books Books IIITDM Kurnool General Stacks 510.5 KLE (Browse shelf(Opens below)) Available 0001510

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.

Includes bibliographical references (p. [805]-814) and index.

There are no comments on this title.

to post a comment.
LIBRARY HOURS
Mon - Sat : 9:00 AM - 5.30 PM
Library will remain closed on public holidays
Contact Us

Librarian
Central Libray
Indian Institute of Information Technology Design and Manufacturing Kurnool
Andhra Pradesh - 518 007

Library Email ID: library@iiitk.ac.in

Copyright @ Central Library | IIITDM Kurnool

Powered by Koha