http://servo.ad.wlu.edu/dokuwiki/ 2026-05-11T23:17:27+00:00 http://servo.ad.wlu.edu/dokuwiki/ http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2018-01-16T06:19:26+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/chapter1?rev=1516083566&do=diff Chapter 1 – Introduction: Some Representative Problems My notes on the assigned sections of Chapter 1 of Algorithm Design by Jon Kleinberg and Éva Tardos. 1.1 – A First Problem: Stable Matching This section details the stable matching problem. The motivation for this problem was originally to create a stable matching algorithm for a college admission process or a job recruiting process that was self-enforcing. The algorithm needs to avoid instabilities: when a man and a woman each prefer each… text/html 2018-01-30T04:54:17+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/chapter2?rev=1517288057&do=diff Chapter 2 – Basics of Algorithm Analysis My notes on the assigned sections of Chapter 2 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details the resource requirements for algorithms, talking about the time and space that they use, later developing run-time bounds for some basic, popular algorithms. text/html 2018-02-07T04:58:57+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/chapter3?rev=1517979537&do=diff Chapter 3 – Graphs My notes on the assigned sections of Chapter 3 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details many elements of Graphs. 3.1 – Basic Definitions and Applications A directed graph consists of nodes that are connected with a specific direction to their connections (edges). Generally a graph refers to an undirected graph. Some examples of graphs include transportation networks, communication networks, information networks, social networks, and dependen… text/html 2018-03-13T03:55:07+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/chapter4?rev=1520913307&do=diff Chapter 4 – Greedy Algorithms My notes on the assigned sections of Chapter 4 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details greedy algorithms. A greedy algorithm is an algorithm that “builds up a solution in small steps, choosing a decision at each step myopically to optimize some underlying criterion. text/html 2018-03-13T03:54:31+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/chapter5?rev=1520913271&do=diff Chapter 5 – Divide and Conquer My notes on the assigned sections of Chapter 5 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details divide and conquer algorithms. A divide and conquer algorithm “breaks the input into several parts, solves the problem in each part recursively, and then combines the solutions text/html 2018-03-27T03:46:12+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/chapter6?rev=1522122372&do=diff Chapter 6 – Dynamic Programming My notes on the assigned sections of Chapter 6 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details dynamic programming. Dynamic programming involves “operating dangerously close to the edge of a brute-force search: although it's systematically working through the exponentially large set of possible solutions to the problem, it does this without ever examining them all explicitly. text/html 2018-04-03T00:48:48+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/chapter7?rev=1522716528&do=diff Chapter 7 – Network Flow My notes on the assigned sections of Chapter 6 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details network flow algorithms like Bipartite Matching and Maximum-Flow. 7.1 – The Maximum-Flow Problem and the Ford-Fulkerson Algorithm text/html 2018-04-03T00:05:51+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/home?rev=1522713951&do=diff Cooper Baird's Wiki * Preface * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6 * Chapter 7 text/html 2018-01-16T04:19:15+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/preface?rev=1516076355&do=diff Preface My notes on the Preface of Algorithm Design by Jon Kleinberg and Éva Tardos. Summary and Insights In the preface, Kleinberg and Tardos outline their motivation and goals for writing Algorithm Design. They begin by first talking about the many applications of algorithms in real life. However, they quickly state that algorithms' many applications isn't the point of the book, but rather that algorithms are a lens in which we can view Computer Science in general. There are two issues in d… text/html 2018-04-03T00:05:32+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bairdc/sidebar?rev=1522713932&do=diff Cooper Baird's Wiki * Preface * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6 * Chapter 7 ---------- <- Cooper's Wiki <- CSCI 211: Algorithm Design and Analysis