Amazon cover image
Image from Amazon.com

Algorithms illuminated / Tim Roughgarden.

By: Material type: TextTextPublisher: New York, NY : Soundlikeyourself Publishing, [2022]Copyright date: 2022Edition: First omnibus editionDescription: xvii, 671 pages : illustrations (black and white) ; 26 cmContent type:
  • text
  • still image
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9780999282984
  • 0999282980
Subject(s): DDC classification:
  • 005.13 23
LOC classification:
  • QA76.9.A43 R68 2022
Other classification:
  • 54.51
Contents:
I. The basics -- Introduction -- Asymptotic notation -- Divide-and-conquer algorithms -- The master method -- QuickSort -- Linear-time selection -- II. Graph algorithms and data structures -- Graphs: the basics -- Graph search and its applications -- Dijkstra's shortest-path algorithms -- The heap data structure -- Search trees -- Hash tables and bloom filters -- III. Greedy algorithms and dynamic programming -- Introduction to greedy algorithms -- Huffman Codes -- Minimum spanning trees -- Introduction to dynamic programming -- Advanced dynamic programming -- Shortest paths revisited -- IV. Algorithms for NP-hard problems -- What is NP-Hardness -- Compromising on correctness: efficient inexact algorithms -- Compromising on speed: exact inefficient algorithms -- Proving problems NP-Hard -- P, NP, and all that -- Case study: the FCC incentive auction -- Quick review of proofs by induction -- Quick review of discrete probability -- Epilogue: A field guide to algorithm design.
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 Call number Copy number Status Date due Barcode Item holds Course reserves
Two Hour Reserve Two Hour Reserve Karen H. Huntsman Library Items Available at the Front Desk 005.13 R755a 1 Available 38060007522857

Advanced Algorithms All year

Total holds: 0

Includes index.

I. The basics -- Introduction -- Asymptotic notation -- Divide-and-conquer algorithms -- The master method -- QuickSort -- Linear-time selection -- II. Graph algorithms and data structures -- Graphs: the basics -- Graph search and its applications -- Dijkstra's shortest-path algorithms -- The heap data structure -- Search trees -- Hash tables and bloom filters -- III. Greedy algorithms and dynamic programming -- Introduction to greedy algorithms -- Huffman Codes -- Minimum spanning trees -- Introduction to dynamic programming -- Advanced dynamic programming -- Shortest paths revisited -- IV. Algorithms for NP-hard problems -- What is NP-Hardness -- Compromising on correctness: efficient inexact algorithms -- Compromising on speed: exact inefficient algorithms -- Proving problems NP-Hard -- P, NP, and all that -- Case study: the FCC incentive auction -- Quick review of proofs by induction -- Quick review of discrete probability -- Epilogue: A field guide to algorithm design.

There are no comments on this title.

to post a comment.

Powered by Koha