|
Size: 1351
Comment:
|
Size: 5239
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| The course is given by [[http://ad.informatik.uni-freiburg.de/staff/bast|Prof. Dr. Hannah Bast]] and takes place every Friday from 2:15pm until about 3:45pm, in room 00-026 (µ-Saal) in building 101. '''NOTE: the regular data for the course might still change!''' The first lecture takes place on Friday, May 6 at the aforementioned time and place. | The course is given by [[http://ad.informatik.uni-freiburg.de/staff/bast|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. |
| Line 8: | Line 8: |
| * Here you can [[http://daphne.informatik.uni-freiburg.de/EfficientRoutePlanningSS2011|register at our course system Daphne]] (please wait until AFTER THE FIRST LECTURE). | * Here is the link to [[https://daphne.informatik.uni-freiburg.de/EfficientRoutePlanningSS2011|Daphne]] (points and links to your SVN and Jenkins). |
| Line 13: | Line 14: |
| * Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): [[attachment:EfficientRoutePlanningSS2011/lecture-1.pdf|Slides]], [[attachment:EfficientRoutePlanningSS2011/exercise-sheet-1.pdf|Exercise Sheet 1]]. | * Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-1.wmv|Recording (WMV)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-1.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-1.pdf|Exercise Sheet 1]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/master-solutions/exercise-sheet-1|Master solutions]], [[EfficientRoutePlanningSS2011/RoadTypesAndSpeeds|Table Road Types <-> Speeds]], [[EfficientRoutePlanningSS2011/Experiments|Table with your experimental results]]. * 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]]. * Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-3.wmv|Recording (WMV)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-3.pdf|Slides]], [[attachment:exercise-sheet-2.pdf|Exercise Sheet 2]], [[http://www.avglab.com/andrew/pub/soda05.pdf|A* with Landmarks paper]]. * Lecture 4, Friday, June 3 2011 (Arc flags): [[attachment:EfficientRoutePlanningSS2011/lecture-4.avi|Recording (AVI)]], [[attachment:lecture-4.pdf|Slides]], [[attachment:exercise-sheet-3.pdf|Exercise Sheet 3]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/master-solutions/exercise-sheet-1|Code from the lecture]], [[EfficientRoutePlanningSS2011/Experiments2|Table Dijkstra & Arc flags]], [[ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-042-2004.pdf|Arc flags papers]]. * Lecture 5, Friday, June 11 2011 (Web application, Google Maps API): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-5.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-5.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-4.pdf|Exercise Sheet 4]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture]], [[http://code.google.com/apis/maps/documentation/javascript|Google Maps JavaScript API]]. * Lecture 6, Friday, June 24 2011 (Highway & Contraction Hierarchies): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-6.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-6.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-5.pdf|Exercise Sheet 5]], [[http://algo2.iti.kit.edu/schultes/hwy/contract.pdf|Contraction Hierarchies paper]]. * Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice, exam info I): [[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]]. * Lecture 8, Friday, July 8, 2011 (Transit Node Routing): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-8.wmv|Recording (WMV)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-8.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-6.pdf|Exercise Sheet 6]], [[http://www.mpi-inf.mpg.de/~bast/papers/transit-dimacs.pdf|Transit Node Routing paper]]. |
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, exam info I): Recording (AVI), Slides, Code from the lecture, Table Contraction Hierarchies running times.
Lecture 8, Friday, July 8, 2011 (Transit Node Routing): Recording (WMV), Slides, Exercise Sheet 6, Transit Node Routing paper.