{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:46:43Z","timestamp":1747284403774,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281276"},{"type":"electronic","value":"9783540319047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535331_11","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T20:51:20Z","timestamp":1279745480000},"page":"181-199","source":"Crossref","is-referenced-by-count":24,"title":["Constrained Shortest Path Computation"],"prefix":"10.1007","author":[{"given":"Manolis","family":"Terrovitis","sequence":"first","affiliation":[]},{"given":"Spiridon","family":"Bakiras","sequence":"additional","affiliation":[]},{"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[]},{"given":"Kyriakos","family":"Mouratidis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The prize collecting travelling salesman problem. Networks\u00a019, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"11_CR5","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 TODS\u00a024, 265\u2013318 (1999)","journal-title":"ACM TODS"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.: Aggregate nearest neighbor queries in spatial databases. ACM TODS (2005) (to appear)","DOI":"10.1145\/1071610.1071616"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Shekhar, S., Kohli, A., Coyle, M.: Path computation algorithms for advanced traveller information system (ATIS). In: ICDE, pp. 31\u201339 (1993)","DOI":"10.1109\/ICDE.1993.344080"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Quarterly of Applied Mathematics\u00a016, 87\u201390 (1958)","journal-title":"Quarterly of Applied Mathematics"},{"key":"11_CR10","volume-title":"Flows in networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fukelson, D.: Flows in networks. Princeton University Press, Princeton (1962)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R. Floyd","year":"1962","unstructured":"Floyd, R.: Shortest path. Communications of the ACM\u00a05, 345 (1962)","journal-title":"Communications of the ACM"},{"key":"11_CR12","unstructured":"Jung, S., Pramanik, S.: HiTi graph model of topographical roadmaps in navigation systems. In: ICDE, pp. 76\u201384 (1996)"},{"key":"11_CR13","first-page":"409","volume":"10","author":"N. Jing","year":"1998","unstructured":"Jing, N., Huang, Y., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE TKDE\u00a010, 409\u2013432 (1998)","journal-title":"IEEE TKDE"},{"key":"11_CR14","unstructured":"Jiang, B.: I\/O-efficiency of shortest path algorithms: An analysis. In: ICDE, pp. 12\u201319 (1992)"},{"key":"11_CR15","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":"11_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":"11_CR17","doi-asserted-by":"crossref","unstructured":"Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. In: GIS, pp. 94\u2013100 (2002)","DOI":"10.1145\/585147.585167"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Jensen, C.S., Kol\u00e1rvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: GIS, pp. 1\u20138 (2003)","DOI":"10.1145\/956676.956677"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Shekhar, S., Yoo, J.S.: Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: GIS, pp. 9\u201316 (2003)","DOI":"10.1145\/956676.956678"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Yiu, M.L., Mamoulis, N.: Clustering objects on a spatial network. In: SIGMOD, pp. 443\u2013454 (2004)","DOI":"10.1145\/1007568.1007619"},{"key":"11_CR21","unstructured":"Huang, Y., Jing, N., Rundensteiner, E.A.: Integrated query processing strategies for spatial path queries. In: ICDE, pp. 477\u2013486 (1997)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB, pp. 287\u2013298 (2002)","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-47724-1_14","volume-title":"Advances in Spatial and Temporal Databases","author":"H. Ferhatosmanoglu","year":"2001","unstructured":"Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.: Constrained nearest neighbor queries. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 257\u2013278. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535331_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T06:10:58Z","timestamp":1740291058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535331_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281276","9783540319047"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11535331_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}