From ea68b7b858047246dd3707d2026d777808d0c7ac Mon Sep 17 00:00:00 2001 From: Rethabile02 <61048685+Rethabile02@users.noreply.github.com> Date: Mon, 31 Oct 2022 16:18:48 +0200 Subject: [PATCH] Update README.md issue #303 link updated --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 6e4bedd..c3590bf 100644 --- a/README.md +++ b/README.md @@ -337,7 +337,7 @@ Courses - [CS 261](http://theory.stanford.edu/~tim/w16/w16.html) **A Second Course in Algorithms** *Stanford University* Lecture Videos Assignments Lecture Notes - Algorithms for network optimization: max-flow, min-cost flow, matching, assignment, and min-cut problems. Introduction to linear programming. Use of LP duality for design and analysis of algorithms. Approximation algorithms for NP-complete problems such as Steiner Trees, Traveling Salesman, and scheduling problems. Randomized algorithms. Introduction to online algorithms. - [Lecture Notes, Videos & Assignments](http://theory.stanford.edu/~tim/w16/w16.html) ([Youtube](https://www.youtube.com/playlist?list=PLEGCF-WLh2RJh2yDxlJJjnKswWdoO8gAc)) -- [CS 473/573](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/) **Fundamental Algorithms** *Univ of Illinois, Urbana-Champaign* Assignments Lecture Notes +- [CS 473/573](http://jeffe.cs.illinois.edu/teaching/algorithms/) **Fundamental Algorithms** *Univ of Illinois, Urbana-Champaign* Assignments Lecture Notes - Algorithms class covering recursion, randomization, amortization, graph algorithms, network flows and hardness. The lecture notes by Prof. Erikson are comprehensive enough to be a book by themselves. Highly recommended! - [Lecture Notes](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/all-algorithms.pdf) - [Labs and Exams](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/all-hwex.pdf)