|
Size: 4685
Comment:
|
Size: 4768
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 15: | Line 15: |
| * Lecture 2, Friday, May 13 2011 (Implementation advice, Build, Test, Style): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-2.avi|Recording (AVI, uncut)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-2.pdf|Slides]], ''No exercise sheet for this lecture'', [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures/lecture-2|Files from the lecture]]. | * Lecture 2, Friday, May 13 2011 (Implementation advice, Build, Test, Style): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-2.avi|Recording (AVI, uncut)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-2.pdf|Slides]], ''No exercise sheet for this lecture'', [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/coding-standards|Coding-standards]]. |
| Line 20: | Line 20: |
| * Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.pdf|Slides]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture]]. | * Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.pdf|Slides]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture]], [[EfficientRoutePlanningSS2011/Experiments3|Table Contraction Hierarchies running times]]. |
Welcome to the Wiki of the course '''Efficient Route Planning''' in the summer term 2011
The course is given by Prof. Dr. Hannah Bast and takes place every Friday from 2:15pm until about 3:45pm, in room 00-026 (µ-Saal) in building 101. The first lecture is on Friday, May 6 and the last lecture is on Friday, August 5. There will be no lecture on the following dates: Friday, May 27 (FAM-workshop) and Friday, June 17 (pentecost holidays). That is 12 lectures altogether.
The teaching assistant for this course is Mirko Brodesser (brodessm@informatik.uni-freiburg.de). The responsibles for the supporting systems (Daphne, SVN, Forum, Jenkins) are Jens Hoffmann (hoffmaje@informatik.uni-freiburg.de) and Axel Lehmann (lehmanna@informatik.uni-freiburg.de).
Important Links
Here is the link to Daphne (points and links to your SVN and Jenkins).
Here is the link to the forum (for annoucements and questions).
Lectures and Exercise Sheets
Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): Recording (WMV), Slides, Exercise Sheet 1, Master solutions, Table Road Types <-> Speeds, Table with your experimental results.
Lecture 2, Friday, May 13 2011 (Implementation advice, Build, Test, Style): Recording (AVI, uncut), Slides, No exercise sheet for this lecture, Coding-standards.
Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): Recording (WMV), Slides, Exercise Sheet 2, A* with Landmarks paper.
Lecture 4, Friday, June 3 2011 (Arc flags): Recording (AVI), Slides, Exercise Sheet 3, Code from the lecture, Table Dijkstra & Arc flags, Arc flags papers.
Lecture 5, Friday, June 11 2011 (Web application, Google Maps API): Recording (AVI), Slides, Exercise Sheet 4, Code from the lecture, Google Maps JavaScript API.
Lecture 6, Friday, June 24 2011 (Highway & Contraction Hierarchies): Recording (AVI), Slides, Exercise Sheet 5, Contraction Hierarchies paper.
Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice): Recording (AVI), Slides, Code from the lecture, Table Contraction Hierarchies running times.