{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:23:01Z","timestamp":1725765781596},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642537028"},{"type":"electronic","value":"9783642537035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-53703-5_38","type":"book-chapter","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T07:37:54Z","timestamp":1387438674000},"page":"364-372","source":"Crossref","is-referenced-by-count":3,"title":["Multi-Point Shortest Path in the Complex Road Network Based on Floyd Algorithm"],"prefix":"10.1007","author":[{"given":"Ying","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"15","key":"38_CR1","first-page":"46","volume":"37","author":"S.-J. Li","year":"2011","unstructured":"Li, S.-J., et al.: Study of Shortest Path Based on Weighted Identification S-graph. Computer Engineering\u00a037(15), 46\u201348 (2011)","journal-title":"Computer Engineering"},{"issue":"6","key":"38_CR2","first-page":"769","volume":"32","author":"L.-Q. Gao","year":"2011","unstructured":"Gao, L.-Q., et al.: The Application of Harmony Search Algorithm for Solving Shortest Path Problems. Journal of Northeastern University (Natural Science)\u00a032(6), 769\u2013772 (2011)","journal-title":"Journal of Northeastern University (Natural Science)"},{"issue":"12","key":"38_CR3","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1016\/S0167-8191(01)00105-3","volume":"27","author":"M.R. Hribar","year":"2001","unstructured":"Hribar, M.R., Taylor, V.E., Boyce, D.E.: Implementing parallel shortest path for parallel transportation applications. Parallel Computing\u00a027(12), 1537\u20131568 (2001)","journal-title":"Parallel Computing"},{"issue":"5","key":"38_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0968-090X(03)00029-9","volume":"11","author":"P. Parichart","year":"2003","unstructured":"Parichart, P., Dongjoo, P., Laurence, R.R., et al.: Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty. Transportation Research Part C: Emerging Technologies\u00a011(5), 331\u2013354 (2003)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"6","key":"38_CR5","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1109\/70.478429","volume":"11","author":"G. Desaulniers","year":"1995","unstructured":"Desaulniers, G., Soumis, F.: An efficient algorithm to find a shortest path for a car-like robot. IEEE Transactions on Robotics and Automation\u00a011(6), 819\u2013828 (1995)","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.eij.2010.10.004","volume":"11","author":"Y.H. Ahmed","year":"2010","unstructured":"Ahmed, Y.H.: A genetic algorithm for finding the k shortest paths in a network. Egyptian Informatics Journal\u00a011(2), 75\u201379 (2010)","journal-title":"Egyptian Informatics Journal"},{"issue":"17","key":"38_CR7","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.comnet.2008.08.013","volume":"52","author":"R. Campos","year":"2008","unstructured":"Campos, R., Ricardo, M.: A Fast Algorithm for Computing Minimum Routing Cost Spanning Trees. Computer Networks\u00a052(17), 3229\u20133247 (2008)","journal-title":"Computer Networks"},{"issue":"17","key":"38_CR8","doi-asserted-by":"publisher","first-page":"3284","DOI":"10.1016\/j.comnet.2008.08.015","volume":"52","author":"S. Shioda","year":"2008","unstructured":"Shioda, S., Ohtsuka, K., Sato, T.: An Efficient Network-wide Broad-casting based on Hop-limited Shortest-path Trees. Computer Networks\u00a052(17), 3284\u20133295 (2008)","journal-title":"Computer Networks"},{"issue":"5","key":"38_CR9","first-page":"41","volume":"15","author":"Q.-J. Yue","year":"2010","unstructured":"Yue, Q.-J., et al.: Design and Realization of Floyd Algorithm System Based on the Optimation of the Shortest Path Problem. Journal of Gansu Normal Colleges\u00a015(5), 41\u201343 (2010)","journal-title":"Journal of Gansu Normal Colleges"},{"issue":"5","key":"38_CR10","first-page":"28","volume":"39","author":"J.-Q. Yang","year":"2010","unstructured":"Yang, J.-Q., et al.: Problem solving of shortest path between the institutions Based on Freud algorithm. Scienfic & Technical Information of Gansu\u00a039(5), 28\u201329 (2010)","journal-title":"Scienfic & Technical Information of Gansu"},{"key":"38_CR11","volume-title":"Principles of Geographical Information Systems","author":"P.A. Burrough","year":"1998","unstructured":"Burrough, P.A., McDonnell, R.A.: Principles of Geographical Information Systems. Oxford University Press, New York (1998)"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"38_CR13","unstructured":"Filho, G.G., Samet, H.: A linear iterative approach for hierarchical shortest path finding. Computer Science Department CS-TR-4417, University of Maryland, College Park, MD (November 2002)"},{"issue":"6","key":"38_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Communications of the ACM\u00a05(6), 345 (1962)","journal-title":"Communications of the ACM"},{"issue":"3","key":"38_CR15","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM)\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"38_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/356625.356627","volume":"6","author":"H. Freeman","year":"1974","unstructured":"Freeman, H.: Computer Processing of Line-Drawing Images. ACM Computing Surveys (CSUR)\u00a06(1), 57\u201397 (1974)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"12","key":"38_CR17","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/358728.358741","volume":"25","author":"I. Gargantini","year":"1982","unstructured":"Gargantini, I.: An effective way to represent quadtrees. Communications of the ACM\u00a025(12), 905\u2013910 (1982)","journal-title":"Communications of the ACM"},{"key":"38_CR18","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, British Columbia, January 23-25 (2005)"},{"key":"38_CR19","unstructured":"Goldberg, A.V., Werneck, R.F.: Computing point-to-point shortest paths from external memory. In: ALENEX 2005: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, Vancouver, BC, Canada (Janyary 2005)"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Gupta, S., Kopparty, S., Ravishankar, C.: Roads, codes, and spatiotemporal queries. In: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Paris, France, June 14-16 (2004)","DOI":"10.1145\/1055558.1055576"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, June 18-21 (1984)","DOI":"10.1145\/602264.602266"},{"issue":"1","key":"38_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences\u00a055(1), 3\u201323 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-60159-7_6","volume-title":"Advances in Spatial Databases","author":"G.R. Hjaltason","year":"1995","unstructured":"Hjaltason, G.R., Samet, H.: Ranking in Spatial Databases. In: Egenhofer, M., Herring, J.R. (eds.) SSD 1995. LNCS, vol.\u00a0951, pp. 83\u201395. Springer, Heidelberg (1995)"},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, Washington, United States, June 01-04, pp. 237\u2013248 (1998)","DOI":"10.1145\/276305.276326"},{"issue":"2","key":"38_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems (TODS)\u00a024(2), 265\u2013318 (1999)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"1","key":"38_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(02)00217-2","volume":"126","author":"D. Hutchinson","year":"2003","unstructured":"Hutchinson, D., Maheshwari, A., Zeh, N.: An external memory data structure for shortest path queries. Discrete Applied Mathematics\u00a0126(1), 55\u201382 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"38_CR27","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N. Jing","year":"1998","unstructured":"Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. IEEE Transactions on Knowledge and Data Engineering\u00a010(3), 409\u2013432 (1998)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"38_CR28","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB 2004: Proceedings of the 30th International Conference on Very Large Data Bases, Toronto, Canada, pp. 840\u2013851 (September 2004)","DOI":"10.1016\/B978-012088469-8\/50074-7"},{"key":"38_CR29","unstructured":"Micikevicius, P.: General parallel computation on commodity graphics hardware: case study with the all-pairs shortest paths problem. In: PDPTA 2004: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, NV, USA, pp. 1359\u20131365 (June 2004)"},{"issue":"4","key":"38_CR30","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J.S.B. Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM Journal on Computing\u00a016(4), 647\u2013668 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"38_CR31","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/15886.15908","volume":"20","author":"R.C. Nelson","year":"1986","unstructured":"Nelson, R.C., Samet, H.: A consistent hierarchical representation for vector data. ACM SIGGRAPH Computer Graphics\u00a020(4), 197\u2013206 (1986)","journal-title":"ACM SIGGRAPH Computer Graphics"}],"container-title":["Communications in Computer and Information Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53703-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T17:13:51Z","timestamp":1558804431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53703-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642537028","9783642537035"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53703-5_38","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}