{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:14Z","timestamp":1725525374231},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_7","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"71-82","source":"Crossref","is-referenced-by-count":7,"title":["All Farthest Neighbors in the Presence of Highways and Obstacles"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF02574015","volume":"11","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Matou\u0161ek, J.: On range searching with semialgebraic sets. Discrete Comput. Geom.\u00a011(1), 393\u2013418 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR2","unstructured":"Ahn, H.-K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.-S., Shin, C.-S., Wolff, A.: Constructing optimal highways. In: Proc. 13th Comput., Australasian Theory Sympos. (CATS), Ballarat, Australia. CRPIT, vol.\u00a065, pp. 7\u201314. ACS (2007)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city Voronoi diagram. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 151\u2013159 (2002)","DOI":"10.1145\/513400.513420"},{"key":"7_CR4","unstructured":"Bae, S.W., Chwa, K.-Y.: The farthest city Voronoi diagram. In: Proc. of the First Meeting of AAAC (2008)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11940128_20","volume-title":"Algorithms and Computation","author":"S.W. Bae","year":"2006","unstructured":"Bae, S.W., Kim, J.-H., Chwa, K.-Y.: Optimal construction of the city Voronoi diagram. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 183\u2013192. Springer, Heidelberg (2006)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: Farthest neighbors and center points in the presence of rectangular obstacles. In: Proc. 17th Annu. ACM Sympos. Comput. Geom., pp. 164\u2013171 (2001)","DOI":"10.1145\/378583.378657"},{"key":"7_CR7","unstructured":"Cardinal, J., Collette, S., Hurtado, F., Langerman, S., Palop, B.: Moving walkways, escalators, and elevators. CoRR, abs\/0705.0635 (2007)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01762115","volume":"3","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: An algorithm for segment dragging and its implementation. Algorithmica\u00a03, 205\u2013221 (1988)","journal-title":"Algorithmica"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry. Discrete Comput. Geom.\u00a04, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"J.S.B. Mitchell","year":"1992","unstructured":"Mitchell, J.S.B.: L 1 shortest paths among polygonal obstacles in the plane. Algorithmica\u00a08, 55\u201388 (1992)","journal-title":"Algorithmica"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"J.S.B. Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Internat. J. Comput. Geom. Appl.\u00a06(3), 309\u2013331 (1996)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ipl.2005.05.005","volume":"95","author":"Y. Ostrovsky-Berman","year":"2005","unstructured":"Ostrovsky-Berman, Y.: The transportation metric and related problems. Inform. Process. Lett.\u00a095, 461\u2013465 (2005)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T23:07:38Z","timestamp":1558134458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}