http://servo.ad.wlu.edu/dokuwiki/ 2026-04-25T04:01:45+00:00 http://servo.ad.wlu.edu/dokuwiki/ http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2012-01-25T01:41:47+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter1.txt?rev=1327455707&do=diff Chapter 1 Introduction: Some Representative Problems This chapter consists of 6 different problems, namely Stable Matching, Interval Scheduling, Weighted Interval Scheduling, Bipartite Matching, Independent Set and Competitive Facility Location. There is a detailed explanation about Stable Matching, with its history, examples, design of its algorithm, its analysis, extensions and proofs. For the rest, the chapter provides information on how these problems are to be dealt with. text/html 2012-01-25T01:38:51+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter2.txt?rev=1327455531&do=diff Chapter 2 Basics of Algorithm Analysis This chapter talks about efficiency of algorithms. Not all algorithms are efficient in terms of their memory usage and speed. “Even bad algorithms can run quickly when applied to small test cases on extremely fast processors; even good algorithms can run slowly when they are coded sloppily.” text/html 2012-02-15T01:48:42+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter3.txt?rev=1329270522&do=diff Chapter 3 Graphs 3.1 Basic Definitions and Applications This chapter, as the name suggests, deals with graphs. Some examples of graphs are: * Transportation Networks * Communication Networks * Information Networks * Social Networks * Dependency Networks text/html 2012-03-06T04:26:49+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter4.txt?rev=1331008009&do=diff Chapter 4 Greedy Algorithms “Greed... is good. Greed is right. Greed works.” -Gordon Gecko, played by Michael Douglas in “Wall Street”, 1987 A greedy algorithm is one that builds up on small steps making decisions to optimize the solution. text/html 2012-03-13T03:32:59+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter5.txt?rev=1331609579&do=diff Chapter 5 Divide and Conquer Comments Sorry the comments have to come first, can't help it. TOO EXCITED! So this is how I view Divide and Conquer: “Breaking a bundle of sticks into two halves is hard, but it is easier to break each of the sticks and then binding them together. text/html 2012-03-27T16:44:13+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter6.txt?rev=1332866653&do=diff Chapter 6 Dynamic Programming The problem with greedy algorithm is that no natural greedy algorithm that works. The problem with divide and conquer algorithm is that it reduces the program to a faster running time, but not necessarily able to reduce exponential algorithms to polynomial runtime. So, we look at Dynamic programming, which is very close to brute force. text/html 2012-04-02T23:38:57+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter7.txt?rev=1333409937&do=diff Chapter 7 Network Flow 7.1 The Maximum-Flow Problem and the Ford-Fulkerson Algorithm The Problem We are given a directed graph with various nodes with edges along with their maximum capacity of flow each of these edges can hold. There is a single source node and a single sink node. Flow from the source should end up in the sink. Also, the flow into a node should equal to the flow out of the node. The problem we need to solve is to find the flow of the maximum possible value. text/html 2012-01-31T17:58:47+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter8.txt?rev=1328032727&do=diff Chapter 8 NP and Computational Intractability Sorry I haven't read this chapter yet. Please try again after we reach this chapter. :) text/html 2012-01-31T17:59:13+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter9.txt?rev=1328032753&do=diff Chapter 9 PSPACE: A Class of Problems beyond NP Sorry I haven't read this chapter yet. Please try again after we reach this chapter. :) text/html 2012-01-31T17:59:35+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter10.txt?rev=1328032775&do=diff Chapter 10 Extending the Limits of Tractability Sorry I haven't read this chapter yet. Please try again after we reach this chapter. :) text/html 2012-01-31T17:55:35+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter11.txt?rev=1328032535&do=diff Chapter 11 Approximation Algorithms Sorry I haven't read this chapter yet. Please try again after we reach this chapter. :) text/html 2012-01-31T17:56:12+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter12.txt?rev=1328032572&do=diff Chapter 12 Local Search Sorry I haven't read this chapter yet. Please try again after we reach this chapter. :) text/html 2012-01-31T17:56:37+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/chapter13.txt?rev=1328032597&do=diff Chapter 13 Randomized Algorithms Sorry I haven't read this chapter yet. Please try again after we reach this chapter. :) text/html 2012-01-31T17:59:55+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/home?rev=1328032795&do=diff Contents * Preface * Chapter 1: Introduction: Some Representative Problems * Chapter 2: Basics of Algorithm Analysis * Chapter 3: Graphs * Chapter 4: Greedy Algorithms * Chapter 5: Divide and Conquer * Chapter 6: Dynamic Programming * Chapter 7: Network Flow * Chapter 8: NP and Computational Intractability * Chapter 9: PSPACE: A Class of Problems beyond NP * Chapter 10: Extending the Limits of Tractability * Chapter 11: Approximation Algorithms * Chapter 12: Local Sear… text/html 2012-01-23T01:07:56+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/suraj/preface.txt?rev=1327280876&do=diff Preface The preface talks about algorithms and its importance, goal of the book, target readers, what the book contains as a whole, problems and solutions in the book, a chapter-by-chapter synopsis of the book, a guidance on how the book is to be used, and acknowledgments. Algorithms are the basis of Computer Science because it helps us in simple matters as addition of numbers to the harder ones as loops, recursion or search with step-by-step methods of dealing with them. The goal of the book, …