{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:20:59Z","timestamp":1765959659165},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312342"},{"type":"electronic","value":"9783642312359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31235-9_35","type":"book-chapter","created":{"date-parts":[[2012,6,14]],"date-time":"2012-06-14T12:12:45Z","timestamp":1339675965000},"page":"526-543","source":"Crossref","is-referenced-by-count":12,"title":["Scalable Computation of Isochrones with Network Expiration"],"prefix":"10.1007","author":[{"given":"Johann","family":"Gamper","sequence":"first","affiliation":[]},{"given":"Michael","family":"B\u00f6hlen","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Innerebner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Balasubramanian, V., Kalashnikov, D.V., Mehrotra, S., Venkatasubramanian, N.: Efficient and scalable multi-geography route planning. In: EDBT, pp. 394\u2013405 (2010)","DOI":"10.1145\/1739041.1739090"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-03456-5_24","volume-title":"Efficient Algorithms","author":"H. Bast","year":"2009","unstructured":"Bast, H.: Car or Public Transport\u2014Two Worlds. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 355\u2013367. Springer, Heidelberg (2009)"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, V., Gamper, J., Loperfido, R., Profanter, S., Putzer, S., Timko, I.: Computing isochrones in multi-modal, schedule-based transport networks. In: ACMGIS, pp. 1\u20132 (2008)","DOI":"10.1145\/1463434.1463524"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"de Almeida, V.T., G\u00fcting, R.H.: Using Dijkstra\u2019s algorithm to incrementally find the k-nearest neighbors in spatial network databases. In: SAC, pp. 58\u201362 (2006)","DOI":"10.1145\/1141277.1141291"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s00778-008-0115-0","volume":"18","author":"K. Deng","year":"2009","unstructured":"Deng, K., Zhou, X., Shen, H.T., Sadiq, S.W., Li, X.: Instance optimal query processing in spatial networks. VLDB J.\u00a018(3), 675\u2013693 (2009)","journal-title":"VLDB J."},{"issue":"1","key":"35_CR6","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(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205\u2013216 (2008)","DOI":"10.1145\/1352431.1352459"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Gamper, J., B\u00f6hlen, M.H., Cometti, W., Innerebner, M.: Defining isochrones in multimodal spatial networks. In: CIKM, pp. 2381\u20132384 (2011)","DOI":"10.1145\/2063576.2063972"},{"key":"35_CR9","first-page":"499","volume-title":"CIKM","author":"A. Gubichev","year":"2010","unstructured":"Gubichev, A., Bedathur, S., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: CIKM, pp. 499\u2013508. ACM, New York (2010)"},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SSC-4","author":"P. Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Systems Science and Cybernetics\u00a0SSC-4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. on Systems Science and Cybernetics"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11687238_14","volume-title":"Advances in Database Technology - EDBT 2006","author":"H. Hu","year":"2006","unstructured":"Hu, H., Lee, D.-L., Xu, J.: Fast\u00a0Nearest\u00a0Neighbor\u00a0Search\u00a0on\u00a0Road\u00a0Networks. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., B\u00f6hm, K., Kemper, A., Grust, T., B\u00f6hm, C. (eds.) EDBT 2006. LNCS, vol.\u00a03896, pp. 186\u2013203. Springer, Heidelberg (2006)"},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10707-006-0011-y","volume":"11","author":"R. Huang","year":"2007","unstructured":"Huang, R.: A schedule-based pathfinding algorithm for transit networks using pattern first search. GeoInformatica\u00a011(2), 269\u2013285 (2007)","journal-title":"GeoInformatica"},{"issue":"3","key":"35_CR13","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 Trans. Knowl. Data Eng.\u00a010(3), 409\u2013432 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"35_CR14","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S. Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng.\u00a014(5), 1029\u20131046 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB, pp. 840\u2013851 (2004)","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-69497-7_12","volume-title":"Scientific and Statistical Database Management","author":"H.-P. Kriegel","year":"2008","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Renz, M., Schmidt, T.: Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks. In: Lud\u00e4scher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol.\u00a05069, pp. 150\u2013167. Springer, Heidelberg (2008)"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-15576-5_30","volume-title":"Advances in Databases and Information Systems","author":"S. Marciuska","year":"2010","unstructured":"Marciuska, S., Gamper, J.: Determining Objects within Isochrones in Spatial Network Databases. In: Catania, B., Ivanovi\u0107, M., Thalheim, B. (eds.) ADBIS 2010. LNCS, vol.\u00a06295, pp. 392\u2013405. Springer, Heidelberg (2010)"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802\u2013813 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD Conference, pp. 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"35_CR22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/380752.380798","volume-title":"STOC","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: STOC, pp. 183\u2013192. ACM, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31235-9_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T10:35:14Z","timestamp":1687516514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31235-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312342","9783642312359"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31235-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}