|Website:||website containing additional information|
|Credits:||7.5 ECTS (=5.25 old credit points)|
|Period:||periode 3 (week 6 t/m 16, dwz 6-2-2006 t/m 21-4-2006; herkansing week 21)|
|Participants:||up till now 12 subscriptions|
|Schedule:||Dit is een oud rooster!
|Contents:||Systems and programs are designed for many purposes and in many ways, but it's algorithms that make things work. Good algorithm design requires understanding and modelling an application, and subsequently studying and analyzing the computational features of the design. In this course we study a number of advanced techniques for efficient algorithm design, often at the hand of problems from networks and graphs. In many applications, networks and graphs are used as a model. Tyical examples are networks of roads, or electronic networks. In other applications, the graph model may be less obvious, but appears to be very useful, like for scheduling problems. In this course, we look to the translation of problem to network model, and we look to algorithmic problems and their solutions on networks and graphs. Some topics are: shortest paths, flow, matchings, triangulated graphs, treewidth (with an application in probabilistic networks), graph drawing, small world networks.|
|Literature:||Most literature will be handed out during the course.
|Course form:||Lectures, two per week. Exercises.|
|Exam form:||There are two tests and a number (8 - 10) exercise sets, and two exams. You must get at least a 4 for the average note of the exercise sets to get a sufficient end note. Then, the end note is the average of the notes for the exercise sets and the exams.|
|Minimum effort to qualify for 2nd chance exam:||At least one of these:
You can do only one of the two exams again. If necessary for a sufficient note, you can receive one or two replacement exercise sets.