Advanced Algorithms
Fall 2008
Course Description
Important Notes : -
It is a collection of lectures notes not ours. Our subjective is to help students to find all engineering notes with different lectures PowerPoint slides in ppt ,pdf or html file at one place. Because we always face that we lose much time by searching in Google or yahoo like search engines to find or downloading a good lecture notes in our subject area with free. Also it is difficult to find popular authoress or books slides with free of cost. If you find any copyrighted slides or notes then please inform me immediately by comments or email as following address .I will take actions to remove it. Please click bellow to download ppt slides/ pdf notes. If you face any problem in downloading or if you find any link not correctly work or if you have any idea to improve this blog/site or if you find any written mistake or you think some subjects notes should be include then give your suggestion as comment by clicking on comment link bellow the post (bottom of page) or email us in this addresshttp://totalproject4engineering.blogspot.com. I will must consider your comments only within 1-2 days. if you have any good class notes/lecture slides in ppt or pdf or html format then please you upload these files to rapidshare.come and send us links or all files by our email addresshttp://totalproject4engineering.blogspot.comsubject=comments on
http://totalproject4engineering.blogspot.comTo find your notes quickly please see the contents on the right hand side of this page which is alphabetically arranged and right click on it. After clicking immediately you find all the notes ppt/pdf/html/video of your searching subjects.
It is better to search your subject notes by clicking on search button which is present at middle of right side of this web page. Then enter your subject and press enter key then you can find all of your lecturesnotes and click on it.
Thank you for visiting our site.........
Click Below to Download the files :-
Lecture Notes
The students in this course were required to take turns scribing lecture notes. They were provided with detailed instructions and a template. The process of scribing lecture notes providesstudents with valuable experience preparing mathematical documents, and also generates a useful set of lecture notes for the class.
Notes are used with the permission of the student scribes.
LEC # | TOPICS | LECTURE NOTES |
---|---|---|
1 | Fibonacci heaps | (PDF) |
2 | Network flows | (PDF) |
3 | Maximum flow; minimum cost circulation | (PDF) |
4 | Goldberg-Tarjan min-cost circulation algorithm | (PDF) |
5 | Cancel-and-tighten algorithm; binary search trees | (PDF) |
6 | Splay trees | (PDF) |
7 | Dynamic trees (part 1) | (PDF) |
8 | Dynamic trees (part 2) | (PDF) |
9 | Linear programming (LP) | (PDF) |
10 | LP: duality, geometry, simplex | (PDF) |
11 | LP: complexity; introduction to the ellipsoid algorithm | (PDF) |
12 | LP: ellipsoid algorithm | (PDF) |
13 | LP: applications of the ellipsoid algorithm | Notes not available |
14 | Conic programming I | (PDF) |
15 | Conic programming II | (PDF) |
16 | Approximation algorithms | (PDF) |
17 | Approximation algorithms (facility location) | (PDF) |
18 | Approximation algorithms (max-cut) | (PDF) |
19 | Max-cut and sparsest-cut | (PDF) |
20 | Multi-commodity flows and metric embeddings | Notes not available |
21 | Convex hulls | Notes not available |
22 | Convex hulls and fixed dimension LP | (PDF) |
23 | Voronoi diagrams | (PDF) |
24 | Approximation scheme for the Euclidean traveling salesman problem | Notes not available |
25 | Streaming algorithms | Notes not available |
26 | Streaming algorithms (cont.) | Notes not available |
No comments:
Post a Comment