Info: Abgabe der Ausarbeitungen bis spätestens So. 27.07.2014, 18:00.
Verantwortliche
Daniel Bahrdt, Stefan Funke, Thomas Mendel, Martin Seybold
Ort und Zeit
Mittwochs, 11:30-13:00 0.118
Themenübersicht:
Thema | Datum | Vortragender | Betreuer | 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!) |
23.4. | Haag | Bahrdt | 16.4. |
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] |
23.4. | Schnelle | Seybold | 16.4. |
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] |
30.4. | Jöst | Mendel | 23.4. |
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] |
30.4. | Lukenich | Bahrdt | 23.4. |
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] |
alt: 7.5. neu: 14.5. |
Tran | Seybold | 30.4. |
Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, and Renato F. Werneck: PHAST: Hardware-Accelerated Shortest Path Trees Technical Report, 2010 [pdf] |
alt: 7.5. neu: 21.5. |
Franco da Silva | Mendel | alt: 30.4. neu: 14.5. |
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] |
alt: 14.5. neu: 21.5. |
Endres | Seybold | alt: 7.5. neu: 14.5. |
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] |
alt: 14.5. neu: 18.6. |
Gregorian | Bahrdt | alt: 7.5. neu: 6.6. |
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] |
18.6. | Fetzer | Mendel | 6.6. |
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] |
alt: 18.6. neu: 25.6. |
Hirschmann | Bahrdt | alt: 6.6. neu: 18.6. |
Daniel Delling, Thomas Pajor, Renato F. Werneck: Round-based Public Transit Routing. In: Proc 14th Meeting on Algorithm Engineering and Experiments [pdf] |
25.06. | Nusser | Mendel | 18.6. |
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