-
1
-
-
34247610284
-
Fast routing in road networks with transit nodes
-
Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes. Fast Routing in Road Networks with Transit Nodes. Science, 316(5824):566, 2007.
-
(2007)
Science
, vol.316
, Issue.5824
, pp. 566
-
-
Bast, H.1
Funke, S.2
Sanders, P.3
Schultes, D.4
-
2
-
-
77955861994
-
Dennis schieferdecker, dominik schultes, and dorothea wagner
-
January Special Section devoted to WEA'08
-
Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, and Dorothea Wagner. Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics, 15:2.3, January 2010. Special Section devoted to WEA'08.
-
(2010)
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics
, vol.15
, pp. 23
-
-
Bauer, R.1
Delling, D.2
Sanders, P.3
-
3
-
-
70349316563
-
Engineering route planning algorithms
-
Jürgen Lerner, Dorothea Wagner, and Katharina A. Zweig, editors Springer
-
Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner. Engineering Route Planning Algorithms. In Jürgen Lerner, Dorothea Wagner, and Katharina A. Zweig, editors, Algorithmics of Large and Complex Networks, volume 5515 of Lecture Notes in Computer Science, pages 117-139. Springer, 2009.
-
(2009)
Algorithmics of Large and Complex Networks, Volume 5515 of Lecture Notes in Computer Science
, pp. 117-139
-
-
Delling, D.1
Sanders, P.2
Schultes, D.3
Wagner, D.4
-
4
-
-
34147120474
-
A note on two problems in connexion with graphs
-
Edsger W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1:269-271, 1959.
-
(1959)
Numerische Mathematik
, vol.1
, pp. 269-271
-
-
Dijkstra, E.W.1
-
6
-
-
79955809738
-
-
Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik
-
Robert Geisberger. Contraction Hierarchies. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik, 2008. http://algo2.iti.uni-karlsruhe.de/documents/routeplanning/geisberger-dipl.pdf.
-
(2008)
Contraction Hierarchies
-
-
Geisberger, R.1
-
7
-
-
45449120587
-
Contraction hierarchies: Faster and simpler hierarchical routing in road networks
-
Catherine C. McGeoch, editor Springer, June
-
Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In Catherine C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of Lecture Notes in Computer Science, pages 319-333. Springer, June 2008.
-
(2008)
Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), Volume 5038 of Lecture Notes in Computer Science
, pp. 319-333
-
-
Geisberger, R.1
Sanders, P.2
Schultes, D.3
Delling, D.4
-
9
-
-
78650671571
-
Distributed time-dependent contraction hierarchies
-
Paola Festa, editor Springer, May
-
Tim Kieritz, Dennis Luxen, Peter Sanders, and Christian Vetter. Distributed Time-Dependent Contraction Hierarchies. In Paola Festa, editor, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of Lecture Notes in Computer Science. Springer, May 2010.
-
(2010)
Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), Volume 6049 of Lecture Notes in Computer Science
-
-
Kieritz, T.1
Luxen, D.2
Sanders, P.3
Vetter, C.4
-
10
-
-
34547943032
-
Computing many-to-many shortest paths using highway hierarchies
-
SIAM
-
Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, and Dorothea Wagner. Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), pages 36-45. SIAM, 2007.
-
(2007)
Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)
, pp. 36-45
-
-
Knopp, S.1
Sanders, P.2
Schultes, D.3
Schulz, F.4
Wagner, D.5
-
11
-
-
0016564037
-
On finding the maxima of a set of vectors
-
H. T. Kung, Fabrizio Luccio, and F. P. Preparata. On Finding the Maxima of a Set of Vectors. Journal of the ACM, 22(4):469-476, 1975.
-
(1975)
Journal of the ACM
, vol.22
, Issue.4
, pp. 469-476
-
-
Kung, H.T.1
Luccio, F.2
Preparata, F.P.3
-
13
-
-
23144464868
-
Is dial-a-ride bus reasonable in large scale towns? - Evaluation of usability of dial-a-ride systems by simulation
-
Springer
-
Masyuku Ohta, Kosuke Shinoda, Yoichiro Kumada, Hideyuki Nakashima, and Itsuki Noda. Is Dial-a-Ride Bus Reasonable in Large Scale Towns? - Evaluation of Usability of Dial-a-Ride Systems by Simulation -. In Multiagent for Mass User Support - First International Workshop, volume 3012 of Lecture Notes in Computer Science, pages 105-119. Springer, 2004.
-
(2004)
Multiagent for Mass User Support - First International Workshop, Volume 3012 of Lecture Notes in Computer Science
, pp. 105-119
-
-
Ohta, M.1
Shinoda, K.2
Kumada, Y.3
Nakashima, H.4
Noda, I.5
-
14
-
-
54249149527
-
Peer-to-peer shared ride systems
-
Springer, August
-
Yun Hui Wu, Lin Jie Guan, and Stephan Winter. Peer-to-Peer Shared Ride Systems. In GeoSensor Networks, volume 4540 of Lecture Notes in Computer Science, pages 252-270. Springer, August 2006.
-
(2006)
GeoSensor Networks, Volume 4540 of Lecture Notes in Computer Science
, pp. 252-270
-
-
Wu, Y.H.1
Guan, L.J.2
Winter, S.3
-
15
-
-
70350375720
-
SMIZE: A spontaneous ride-sharing system for individual urban transit
-
Springer, September
-
Xin Xing, Tobias Warden, Tom Nicolai, and Otthein Herzog. SMIZE: A spontaneous Ride-Sharing System for Individual Urban Transit. In Proceedings of the 7th German Conference on Multiagent System Technologies (MATES 2009), volume 5774 of Lecture Notes in Computer Science, pages 165-176. Springer, September 2009.
-
(2009)
Proceedings of the 7th German Conference on Multiagent System Technologies (MATES 2009), Volume 5774 of Lecture Notes in Computer Science
, pp. 165-176
-
-
Xing, X.1
Warden, T.2
Nicolai, T.3
Herzog, O.4
|