{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:48Z","timestamp":1740099048314,"version":"3.37.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920122"},{"type":"electronic","value":"9783319920139"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92013-9_32","type":"book-chapter","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T08:57:09Z","timestamp":1526547429000},"page":"354-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Visualising Top-k Alternative Routes"],"prefix":"10.1007","author":[{"given":"Lingxiao","family":"Li","sequence":"first","affiliation":[]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[]},{"given":"David","family":"Taniar","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Indrawan-Santiago","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"issue":"6","key":"32_CR1","doi-asserted-by":"publisher","first-page":"492","DOI":"10.14778\/2904121.2904125","volume":"9","author":"T Abeywickrama","year":"2016","unstructured":"Abeywickrama, T., Cheema, M.A., Taniar, D.: K-nearest neighbors on road networks: a journey in experimentation and in-memory implementation. Proc. VLDB Endow. 9(6), 492\u2013503 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-13193-6_3","volume-title":"Experimental Algorithms","author":"I Abraham","year":"2010","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative routes in road networks. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 23\u201334. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13193-6_3"},{"key":"32_CR3","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U.: Exact and approximate algorithms for finding k-shortest paths with limited overlap. In: EDxBT, pp. 414\u2013425 (2017)"},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"32_CR5","unstructured":"Cambridge Vehicle Information Technology Ltd., Choice Routing (2005). \nhttp:\/\/www.camvit.com"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92013-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T09:06:03Z","timestamp":1526547963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92013-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920122","9783319920139"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92013-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}