■
Team
■
Teaching
Information for students of B.Sc./M.Sc. Mathematics
Summer 2021
■
Winter 2020
Summer 2020
■
Winter 2019
■
Summer 2019
■
Winter 2018
■
Summer 2018
■
Winter 2017
■
Summer 2017
■
Winter 2016
■
Summer 2016
■
Winter 2015
■
Summer 2015
■
Winter 2014
Algorithms for OpenStreetMap data
Discrete Optimization
Erg. zu Algorithmen, Berechenbarkeit & Komplexität
Ergänzungen zu Logik & DS
Studienprojekt STANKER
■
Summer 2014
■
Winter 2013
■
Summer 2013
■
Winter 2012
■
Summer 2012
■
Winter 2011
Former Semester
BSc, Master-, Student-, Diplomathesis
StuPro/ ProjektINF/ SoPra/ FaPra
■
Research
Publications
Projects
Student Projects
 

Diskrete Optimierung/Discrete Optimization

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:

Day Time Location
Tuesday 12:00-13:30 V38.01
Thursday 09:52-11:22 V38.04

Note the slightly shifted slots to accomodate students that need to be flown in from Hohenheim.

Note: The location of the lecture on thursday was changed to V38.04 (starting at October 30th, 2014).

Note: The location of the lecture on tuesday was changed to V38.01 (starting at November 4th, 2014).

Intro-Slides: PDF

Lecture notes: PDF (update 10.02.2015)

FakeMC-Test PDF

MC-Test 2/2013 PDF

Summary with exclusions for the final exam PDF

Dropbox-Link for the material in case you cannot access this webpage from at home.

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.

Exams

1st MC Test:
Thursday, November 27th, 10:15-11:15, V38.04
The results of the first MC-Test are available here.
2nd MC Test:
Thursday, February 12th, 10:15-11:15, V38.04
The results of the second MC-Test are available here.
3rd MC-Test:
Wednesday, March 4th, 11:00-12:00, V38.04
The results of the third MC-Test area available here.

The “Scheinliste” is available. Please check your state.

 

Q&A Session: Wednesday, March 4th, 12:00-13:00, V.38.04

For the final exam please check the website of the Prüfungsamt.

You may find the results of the exam at the institute’s blackboard.

The exam review is at April 17th, 3:00 pm in room 1.168.

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 problems on your own.

We will discuss the problems during the tutorial.

Exercise Sheets:

not available anymore

Literature

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

Also have a look at the same lecture in WS 13/14 and WS 12/13.

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.