Learn how shortest-path algorithms from the 1950's (i.e., pre-ARPANET!) govern the way that your Internet traffic gets routed today why efficient algorithms are fundamental to modern genomics and how to make a million bucks in prize money by 'just' solving a math problem! Finally, we'll study several strategies for dealing with hard (i.e., NP-complete problems), including the design and analysis of heuristics. NP' problem mean for the algorithm designer.
You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments. You'll learn what NP-completeness and the famous 'P vs. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. In this course you will learn several fundamental principles of advanced algorithm design.