From 85f99454e51690c4b84bb5c6ed6e0e019f4ec8be Mon Sep 17 00:00:00 2001 From: Elliptica Date: Tue, 20 Dec 2016 11:54:16 +0200 Subject: [PATCH] Fix typo --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 8d8bcbc..ee47cdf 100644 --- a/README.md +++ b/README.md @@ -1042,7 +1042,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th - [ ] [Complexity: P, NP, NP-completeness, Reductions (video)](https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=22) - [ ] [Complexity: Approximation Algorithms (video)](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24) - [ ] [Complexity: Fixed-Parameter Algorithms (video)](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) - - Peter Norvik discusses near-optimal solutions to traveling salesman problem: + - Peter Norvig discusses near-optimal solutions to traveling salesman problem: - [Jupyter Notebook](http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb) - Pages 1048 - 1140 in CLRS if you have it.