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-30T02:43:29+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/chapter1?rev=1517280209&do=diff Chapter 1 - Introduction: Some Representative Problems Section 1.1 Note: I accidentally read this section before class, rather than after. My “second time around” response should still be interpreted as after class, though, because I reread the section after class in order to write this Wiki. All Wiki's following this one, though, should be based on reading that I did strictly after the material was first presented in class. text/html 2018-01-30T02:43:20+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/chapter2?rev=1517280200&do=diff Chapter 2 - Basics of Algorithm Analysis Section 2.1 * Summary: Section 2.1 is Computational Intractability. The title is a little misleading, though, because the section is really about efficiency. Either that, or I don't know the definition of computational intractability. The authors talk about time and space efficiency, and then they progress through increasingly precise and robust definitions for efficiency, dispelling any misconceptions readers might have along the way. After the first… text/html 2018-02-06T22:33:01+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/chapter3?rev=1517956381&do=diff Chapter 3 - Graphs Section 3.1 * Summary: Section 3.1 is Basic Definitions and Applications. Graphs consist of nodes and edges, where the edges join two nodes. Graphs can be undirected or directed, and graphs are assumed to be undirected unless stated otherwise. Technically, an edge between nodes u and v in an undirected graph is represented as the set {u,v}, but the authors warn that the notation for a directed edge, (u,v), will sometimes be used even for undirected edges. The directed edge… text/html 2018-03-13T01:40:35+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/chapter4?rev=1520905235&do=diff Chapter 4 - Greedy Algorithms Front Matter * Summary: In this prelude to Chapter 4 - Greedy Algorithms, the authors introduce us to the idea of a greedy algorithm: one that builds a solution incrementally by choosing the optimal step each time. They say the steps are chosen text/html 2018-03-13T01:52:41+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/chapter5?rev=1520905961&do=diff Chapter 5 - Divide and Conquer Section 5.1 * Summary: Section 5.1 is A First Recurrence: The Mergesort Algorithm. Mergesort sorts a list of numbers by splitting the list in half and sorting each half recursively. It combines the two halves back together using an O(n) process. Because this problem has a runtime of T(n) in the worst case and spends O(n) time splitting and recombining the input, we can define a recurrence relation as: T(n) \leq 2T(n/2) + cn when n > 2 and T(2) \leq c. Most recu… text/html 2018-03-27T01:04:45+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/chapter6?rev=1522112685&do=diff Chapter 6 - Dynamic Programming Section 6.1 * Summary & Motivations: Section 6.1 is Weighted Interval Scheduling: A Recursive Procedure. In this section, we revisit the weighted interval scheduling problem from Chapter 1.2. Whereas before we wanted to pick non-overlapping intervals, now we want to maximize the value we derive from the intervals. The solution to this problem rests on the notion that each interval either is or is not in the optimal solution. If it is, the optimal solution's va… text/html 2018-04-03T03:42:22+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/chapter7?rev=1522726942&do=diff Chapter 7 - Network Flow Section 7.1 * Summary & Motivations: Section 7.1 is The Maximum-Flow Problem and the Ford-Fulkerson Algorithm. This subsection addresses network models, and the key pieces for any such problem are capacities on edges, a source node, a sink node, and the traffic that flows on the network. For simplicity, we assume the capacities are integers. While defining flow, we assert two conditions: the capacity condition and the conservation condition. The capacity condition sa… text/html 2018-04-02T13:21:43+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/home?rev=1522675303&do=diff Rebecca's Wiki * Preface: first two pages * Chapter 1: Section 1.1 * Chapter 2: Sections 2.1-2.5 * Chapter 3: Sections 3.1-3.6 * Chapter 4: Front Matter, Sections 4.1-4.2, & Sections 4.4-4.8 * Chapter 5: Sections 5.1-5.3 * Chapter 6: Sections 6.1-6.3 * Chapter 7: Sections 7.1-7.2, Section 7.5, & Section 7.7 text/html 2018-01-30T02:43:36+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/melkersonr/preface?rev=1517280216&do=diff Preface First Two Pages * Summary: Like any preface, the preface of Algorithm Design by Kleinberg and Tardos serves to introduce the book and the topic at hand. In the first two pages specifically, the authors deliver a message about how rampant algorithms are in everyday life and, consequently, why it is important to study them. The authors give numerous examples of the use of algorithms to drive this point. They make sure to note, though, that the numerous applications for algorithms is no…