{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:04Z","timestamp":1725603664059},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_49","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"579-590","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Distance Queries for Weighted Polyhedral Surfaces"],"prefix":"10.1007","author":[{"given":"Hristo N.","family":"Djidjev","sequence":"first","affiliation":[]},{"given":"Christian","family":"Sommer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C.: Object location using path separators. In: PODC, pp. 188\u2013197 (2006)","DOI":"10.1145\/1146381.1146411"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/s00454-009-9204-0","volume":"44","author":"L. Aleksandrov","year":"2010","unstructured":"Aleksandrov, L., Djidjev, H.N., Guo, H., Maheshwari, A., Nussbaum, D., Sack, J.R.: Algorithms for approximate shortest path queries on weighted polyhedral surfaces. Discrete Comput. Geom.\u00a044, 762\u2013801 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"49_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L. Aleksandrov","year":"2005","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM\u00a052(1), 25\u201353 (2005)","journal-title":"J. ACM"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Cabello, S.: Many distances in planar graphs. In: SODA, pp. 1213\u20131220 (2006); a preprint of the Journal version is available in the University of Ljubljana preprint series 47, 1089 (2009)","DOI":"10.1145\/1109557.1109691"},{"key":"49_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-62559-3_14","volume":"1197","author":"H. Djidjev","year":"1997","unstructured":"Djidjev, H.: Efficient algorithms for shortest path queries in planar digraphs. Graph-Theoretic Concepts in Computer Science\u00a01197, 151\u2013165 (1997)","journal-title":"Graph-Theoretic Concepts in Computer Science"},{"issue":"5","key":"49_CR6","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.jcss.2005.05.007","volume":"72","author":"J. Fakcharoenphol","year":"2006","unstructured":"Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci.\u00a072(5), 868\u2013889 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-22006-7_12","volume-title":"Automata, Languages and Programming","author":"K.-i. Kawarabayashi","year":"2011","unstructured":"Kawarabayashi, K.-i., Klein, P.N., Sommer, C.: Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 135\u2013146. Springer, Heidelberg (2011)"},{"key":"49_CR8","unstructured":"Klein, P.N.: Preprocessing an undirected planar network to enable fast approximate distance queries. In: SODA, pp. 820\u2013827 (2002)"},{"issue":"3","key":"49_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/PL00009223","volume":"22","author":"P.N. Klein","year":"1998","unstructured":"Klein, P.N., Subramanian, S.: A fully dynamic approximation scheme for shortest paths in planar graphs. Algorithmica\u00a022(3), 235\u2013249 (1998)","journal-title":"Algorithmica"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: finding shortest paths through a weighted planar subdivision. J. ACM\u00a038, 18\u201373 (1991)","journal-title":"J. ACM"},{"key":"49_CR11","unstructured":"Mozes, S., Sommer, C.: Exact distance oracles for planar graphs. CoRR abs\/1011.5549 (2010)"},{"issue":"1","key":"49_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.004","volume":"58","author":"Z. Sun","year":"2006","unstructured":"Sun, Z., Reif, J.H.: On finding approximate optimal paths in weighted regions. J. Algorithms\u00a058(1), 1\u201332 (2006)","journal-title":"J. Algorithms"},{"issue":"6","key":"49_CR13","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM\u00a051(6), 993\u20131024 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"49_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM\u00a052(1), 1\u201324 (2005)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:28Z","timestamp":1560514108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}