Neeldhara
  • About
  • Research
    • Overview
    • People
    • Publications
    • Surveys
  • Teaching
    • Courses
    • Materials
  • Lists
    • Puzzles
    • Bookmarks
  • Exposition
    • Talks
    • Videos
  • Events
  • Blog

Advanced Algorithms

  • Advanced Algorithms
    • Flows
    • Intractability
    • Approximation Algorithms
    • Randomized Algorithms
    • Greedy Algorithms
      • 1. Storing Files on a Tape
      • 2. A Scheduling Problem
      • 3. Stable Matchings
    • Matroids
      • 1. The Motivation
      • 2. The Definition
      • 3. Greedy Works!
      • 4. Scheduling with Deadlines
    • Dynamic Programming
      • 1. Longest Increasing Subsequence
      • 2. Subset Sum
      • 3. Set Cover
      • 4. Optimal BSTs
      • 5. Maximum Independent Set on Trees

Advanced Algorithms

Lecture Notes

on Advanced Algorithms


 

These are running notes on selected topics in Advanced Algorithms.

I have been developing these as a part of my course on Advanced Algorithms that I teach at both IIT Gandhinagar and also as a part of the IIT Madras online BS program. Please see the course websites for additional materials (e.g, problem sets).

At the time of this writing these notes are largely raw and informal. They certainly do not substitute — but hopefully do supplement — an actual textbook :) I do borrow heavily from Algorithms by Erickson.

If you have any general comments or questions, please leave them below. Thanks!


© 2022 • Neeldhara Misra • Credits •

 

Corrections? Please leave a comment here or a PR in this repository, thanks!

I’d rather be a failure at something I love than a success at something I hate.

George Burns

You live and you learn — at any rate, you live.

Douglas Adams

A problem worthy of attack proves its worth by fighting back.

Paul Erdos

×