■
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
Algorithmen und Berechenbarkeit / Formale Methoden
Algorithms for OpenStreetMap data
Discrete Optimization
Ergänzungen zu FSuA
Seminar: Fortgeschrittene Routenplanung
■
Summer 2016
■
Winter 2015
■
Summer 2015
■
Winter 2014
■
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
 

Seminar: Fortgeschrittene Routenplanung

Verantwortliche

Daniel Bahrdt, Stefan Funke

Ort und Zeit

Montags, 11:30-13:00 bzw. nach Absprache, Raum 1.140

1. Termin mit Themenzuordnung am 19.10.2016

Themenübersicht:

Thema Datum Vortragender Vorbesprechungstermin
(spätestens)
Andrew V. Goldberg and Chris Harrelson:
Computing the Shortest Path: A* Search Meets Graph Theory
In: Proceedings of the 16th Annual ACM SIAM Symposium on Discrete Algorithms (SODA’05), 2005 pages 156-165. [pdf] (nur aus Uninetz!)		 21.11 fällt aus
Hannah Bast, Stefan Funke, Domagoj Matijevic:
Ultrafast Shortest-Path Queries via Transit Nodes
In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 2009 [pdf]		 21.11 Mohammadi
Daniel Delling, Robert Geisberger, Peter Sanders, Dominik Schultes:
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
In: Proceedings of the 7th Workshop on Experimental Algorithms (WEA’08), volume 5038 of Lecture Notes in Computer Science, pages 319-333. Springer, June 2008 [pdf]		 28.11 Wiesenfarth
Stefan Funke, André Nusser, Sabine Storandt:
On k-Path Covers and their applications
In: Special Issue: Best papers of VLDB 2014 pages 103-123 [pdf]		 28.11 Nalivayko
Ronald J. Gutman:
Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks
In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX’04), 2004 pages 100-111 [pdf]		 5.12 Stercken
Andrew V. Goldberg and Haim Kaplan and Renato F. Werneck:
Reach for A*: Efficient Point-To-Point Shortest Path Algorithms
In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX’06) [pdf]		 5.12 Wonner
Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, and Renato F. Werneck:
PHAST: Hardware-Accelerated Shortest Path Trees
Technical Report, 2010 [pdf]		 12.12 Schmidt
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck:
A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks
In: Proceedings of the 10th International Symposium on Experimental Algorithms (SEA’11) [pdf]		 12.12 Rau
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning
In: Proceedings of the 10th International Symposium on Experimental Algorithms (SEA’11), volume 6630 of Lecture Notes in Computer Science, pages 376-387. Springer, 2011 [pdf]		 19.12 Weitbrecht
Jochen Eisner, Stefan Funke, and Sabine Storandt:
Optimal Route Planning for Electric Vehicles in Large Networks
In: Proc. 25th AAAI Conference on Artificial Intelligence, 2011 [pdf]		 19.12 Kononov
Ittai Abraham, Daniel Delling, Andrew Goldberg, and Renato Werneck:
Alternative Routes in Road Networks.
In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA’10), volume 6049 of Lecture Notes in Computer Science, pages 23-34. Springer, May 2010 [pdf]		 23.1 Pilz
Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-based Public Transit Routing.
In: Proc 14th Meeting on Algorithm Engineering and Experiments [pdf]		 9.1 Hoshaber

Sonstiges:

  • Vortrag von 30 Minuten (angelehnt an einen Konferenzvortrag, welcher üblicherweise 20 Minuten dauert)
  • Ausarbeitung des Vortrags spätestens eine Woche vor Termin beim Betreuer vorzeigen
  • Anwesenheit und Teilnahme an den Diskussionen Pflicht (!)
  • Es wird vorausgesetzt, dass die Teilnehmer mit grundlegenden Algorithmen wie Dijkstra’s Algorithmus vertraut sind

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.