Prof. Dr. Stefan Funke

This lecture takes place twice a week (on average 3 h of lecture and 1 h tutorial) in the following slots:

Time Location Schedule
Oct. Nov. Dec. Jan. Feb.
Tuesday 12:00 - 13:30 V 38.01 17., 24. 7., 14., 21., 28. 5., 12., 19. 9., 16., 23., 30.
Thursday 9:45 - 11:15 V 38.04 19., 26. 2., 9., 16., 23., 30. 7., 14., 21.* 11., 18., 25. 1.*, 8.

Exercise
* MC-Test

There will be a written exam at the end of the semester (unless your Prüfungsordnung does not allow that; in that case, there will be an oral exam). Prerequisite for participation in the exam is a ‘Schein’, i.e. you need to pass two MC-tests.

News

  • The results of the fall exams are announced on the notice board at the institute!
  • The exam grading scale has been adjusted in favor of the student (Passing mark was reduced to 55 points).
  • Updated the exam results. Some gradings have changed by 0 to +4 points in the first section.
  • The exam results are published at the institutes notice board (near room 1.101).
    The exam review will take place at april, 11th 3:30 pm (15:30) in room 1.140.
  • The results of the third mc test are published at the institutes notice board (near room 1.101).
    Please all check your “Schein” status to ensure you fullfill the prerequisite to write the exam!
  • The third mc test will take place at feb. 28th, 2:00 p.m. in room 0.108. You need to participate if you passed only one of the former two mc tests.
  • The summary slides to the lecture are now available
  • The results of the second mc test are published at the institutes notice board (near room 1.101).
  • There will be an repetition course from feb. 21st to feb. 28th. Please find more information below.
  • There will be no lecture/tutorial at feb. 6th
  • The results of the first mc test are published at the institutes notice board (near room 1.101).

Repetition Course

The repetition course contains a lecture (held in german) to repeat basic lecture stuff. A supervised exercise session follows to deepen the topics and pose some questions.

The course will take place in the lecture hall V38.02 in the computer science building.
The course dates are as follows:

Date Wed., feb 21st Thu., feb 22nd Mon., feb 26th Tue., feb 27th Wed., feb 28th
Lecture 14:00 - 15:30 9:45 - 11:15 9:45 - 11:15 9:45 - 11:15 9:45 - 11:15
Exercise 15:45 - 17:15 11:30 - 13:00 11:30 - 13:00 11:30 - 13:00 11:30 - 13:00

Repetition exercise sheets

not available anymore

Exercises/Tutorials

Filip Krumpe

The final dates of the tutorials are announced during lecture at least one week before the tutorial takes place. For each tutorial there will be an exercise sheet. Please take a look at the sheet before the tutorial and solve the exercises on your own.

A fake MC-test of the year 2014 can be found here.

Exercise Sheets:

not available anymore

Literature

A very good book on approximation algorithms by Shmoys and Williamson can be found online.

Lecture Notes (currently work in progress. Please report any mistakes if you find some).

Basic Concepts

should be easy to find via google, e.g.

Intended Audience

Students at the master (INF, SWT, INFOTECH, Winfo, …) or advanced Bachelor level.

News

[Oct’21] We have migrated to our new webssite here!

[Jun’19] Our paper on trajectory storage and retrieval has been accepted at SSTD 2019!

[Nov’18] Our paper on regret minimization has been accepted at AAAI 2019 (acceptance rate 16.2%)!

[Oct’18] Our paper on alternative route planning for bicycles has been accepted at ALENEX 2019!

[Apr’18] Martin has successfully defended his Ph.D. thesis. Congratulations!

[Jan’18] The journal version of our paper on k-hop path covers will receive a publication award from our university!

[Nov’17] Our paper on a theoretical explanation for several speed-up techniques for route computation has been accepted at AAAI 2018!

[Oct’17] Thomas’ paper on area preserving map simplification has been accepted at ALENEX 2018!

[May’17] Daniel’s and Martin’s paper on rational points on the unit sphere has been accepted at ISSAC 2017!

[Apr’17] Our paper on personalized route planning with dynamic approximation guarantees has been accepted at SEA 2017!

[Jan’17] Martin’s paper on map matching has been accepted at SIAM SDM 2017!

[Nov’16] Our paper on simultaneous maze solving has been accepted at AAAI 2017.

[Okt’16] Two papers, one on growing balls (!), the other on map simplification will be presented at ALENEX 2017.

[Sep’16] Our paper on Deducing Individual Driving Preferences has been accepted at the 24th ACM SIGSPATIAL GIS 2016.

[Feb’16] Our paper on placing loading stations for EVs has been accepted at ICAPS 2016.

[Jul’15] Paper about our GeoSearch Engine OSCAR at the 16th Int. Conf on Web Information Systems Engineering (WISE)!

[Jun’15] We feel very honored to have our VLDB’14 paper almost verbatimly reproduced in the ‘prestigous’ journal IJSETR, see here. Yeah! 😉

[Feb’15] We were lucky to receive a Google Research Award for research on personalized route planning!

[Sep’14] Our paper “On k-Path Covers and their Applications” has received a Best Paper Award at the 40th Int. Conference on Very Large Databases (VLDB) in Hangzhou (5 out of 139 accepted out of 695 submitted papers).

[Sep’14] Our paper on “Energy-efficient Routing: Taking Speed into Account” has received a Best Paper Award at the 37th German Conference on Artificial Intelligence (KI).

[Jul’14] Our paper “Placement of Loading Stations for Electric Vehicles: No Detours Necessary!” has received a Honorable Mention at the 28th AAAI Conference on Artificial Intelligence (AAAI) in Quebec City (5 nominated out of 398 accepted out of 1406 submitted papers).

[Mar’14] Our StuPro-Team has completed their great “SchulScheduler” project.

[Nov’13] Jochen has defended his PhD thesis and moved on to TomTom.

[Feb’13] Sabine has defended her PhD thesis (already in Dec’12) and received the INFOS award for best CS PhD thesis in 2012!

[Mar’12] Our paper Path Shapes - An Alternative Method for Map Matching and Fully Autonomous Self-Localization presented at GIS 2011 has received the Best Paper Award, also see the ACM SIGSPATIAL newsletter.