{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:02:04Z","timestamp":1725501724319},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387308586"},{"type":"electronic","value":"9780387359731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-35973-1_1416","type":"book-chapter","created":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T18:27:24Z","timestamp":1199816844000},"page":"1176-1181","source":"Crossref","is-referenced-by-count":5,"title":["Trip Planning Queries in Road Network Databases"],"prefix":"10.1007","author":[{"given":"Feifei","family":"Li","sequence":"first","affiliation":[]},{"given":"Marios","family":"Hadjieleftheriou","sequence":"additional","affiliation":[]},{"given":"George","family":"Kollios","sequence":"additional","affiliation":[]},{"given":"Dihan","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"1416_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial-Time Approximation Schemes for Euclidean TSP and other Geometric Problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"1416_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time-Windows. In: Proc. of FOCS (2004)","DOI":"10.1145\/1007352.1007385"},{"key":"1416_CR3","unstructured":"Christofides, N.: Worst-case analysis of a\u00a0new heuristic for the travelling salesman problem. Technical report, Computer Science Department, CMU (1976)"},{"key":"1416_CR4","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. The MIT Press (1997)"},{"key":"1416_CR5","unstructured":"Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for tsp with neighborhoods in the plane. In: SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp. 38\u201346 (2001)"},{"key":"1416_CR6","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A\u00a0Polylogarithmic Approximation Algorithm for the Group Steiner Tree  Problem. In: Proc. of SODA (1998)"},{"key":"1416_CR7","doi-asserted-by":"crossref","unstructured":"Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng., S.-H.: On trip planning queries in spatial databases. In: SSTD: Proc. of the International Symposium on Advances in Spatial and Temporal Databases, pp. 273\u2013290 (2005)","DOI":"10.1007\/11535331_16"},{"key":"1416_CR8","doi-asserted-by":"crossref","unstructured":"Ma, X., Shekhar, S., Xiong, H., Zhang, P.: Exploiting a\u00a0page-level upper bound for multi-type nearest neighbor queries. In: ACM GIS, pp. 179\u2013186 (2006)","DOI":"10.1145\/1183471.1183501"},{"key":"1416_CR9","doi-asserted-by":"crossref","unstructured":"Myung, Y., Lee, C., Tcha, D.: On the Generalized Minimum Spanning Tree Problem. Networks (1995)","DOI":"10.1002\/net.3230260407"},{"key":"1416_CR10","doi-asserted-by":"crossref","unstructured":"Papadias,\nD., Zhang, J., Mamoulis, N., Taom, Y.: Query Processing in Spatial\nNetwork Databases. In: Proc. of VLDB\n(2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"1416_CR11","doi-asserted-by":"crossref","unstructured":"Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The Optimal Sequenced Route Query. VLDB Journal (2007)","DOI":"10.1007\/s00778-006-0038-6"},{"issue":"1","key":"1416_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/69.567054","volume":"9","author":"S. Shekhar","year":"1997","unstructured":"Shekhar, S., Liu, D.: CCAM: A\u00a0connectivity\/clustered access method for networks and network computations. IEEE TKDE 19(1), 102\u2013119 (1997)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1416_CR13","unstructured":"TSP Home\u00a0Web Site. \n                  http:\/\/www.tsp.gatech.edu\/"},{"key":"1416_CR14","doi-asserted-by":"crossref","unstructured":"Yiu, M., Mamoulis, N.: Clustering Objects on a\u00a0Spatial Network. In: Proc. of SIGMOD (2004)","DOI":"10.1145\/1007568.1007619"}],"container-title":["Encyclopedia of GIS"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-35973-1_1416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T11:04:05Z","timestamp":1557659045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35973-1_1416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387308586","9780387359731"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35973-1_1416","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}