{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:46:36Z","timestamp":1743075996643,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_6","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"52-61","source":"Crossref","is-referenced-by-count":1,"title":["Group Nearest Neighbor Queries in the L 1 Plane"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Sang Won","family":"Bae","sequence":"additional","affiliation":[]},{"given":"Wanbin","family":"Son","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/2213556.2213588","volume-title":"Proceedings of the 31st Symposium on Principles of Database Systems, PODS 2012","author":"P.K. Agarwal","year":"2012","unstructured":"Agarwal, P.K., Efrat, A., Sankararaman, S., Zhang, W.: Nearest-neighbor searching under uncertainty. In: Proceedings of the 31st Symposium on Principles of Database Systems, PODS 2012, pp. 225\u2013236. ACM, New York (2012)"},{"issue":"6","key":"6_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM\u00a045(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-00202-1_7","volume-title":"WALCOM: Algorithms and Computation","author":"S.W. Bae","year":"2009","unstructured":"Bae, S.W., Korman, M., Tokuyama, T.: All farthest neighbors in the presence of highways and obstacles. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 71\u201382. Springer, Heidelberg (2009)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/22145.22169","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985","author":"S.W. Bent","year":"1985","unstructured":"Bent, S.W., John, J.W.: Finding the median requires 2n comparisons. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 213\u2013216. ACM, New York (1985)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of the 23rd International Conference on Machine Learning, ICML 2006, pp. 97\u2013104. ACM, New York (2006)","DOI":"10.1145\/1143844.1143857"},{"issue":"1","key":"6_CR6","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(1), 205\u2013221 (1988)","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(02)00431-0","volume":"296","author":"O. Cheong","year":"2003","unstructured":"Cheong, O., Shin, C.-S., Vigneron, A.: Computing farthest neighbors on a convex polytope. Theoretical Computer Science\u00a0296(1), 47\u201358 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0377-2217(85)90006-2","volume":"20","author":"R. Durier","year":"1985","unstructured":"Durier, R., Michelot, C.: Geometrical properties of the fermat-weber problem. European Journal of Operational Research\u00a020(3), 332\u2013343 (1985)","journal-title":"European Journal of Operational Research"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20152-3_12","volume-title":"Database Systems for Advanced Applications","author":"Y. Gao","year":"2011","unstructured":"Gao, Y., Shou, L., Chen, K., Chen, G.: Aggregate farthest-neighbor queries over spatial data. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part II. LNCS, vol.\u00a06588, pp. 149\u2013163. Springer, Heidelberg (2011)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/276698.276876","volume-title":"Proceedings of the Thirteeth Annual ACM Symposium on Theory of Computing, STOC 1998","author":"P. Indyk","year":"1998","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirteeth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604\u2013613. ACM, New York (1998)"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst.\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"01n02","key":"6_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1142\/S0218195995000040","volume":"05","author":"N. Katoh","year":"1995","unstructured":"Katoh, N., Iwano, K.: Finding k farthest pairs and k closest\/farthest bichromatic pairs for points in the plane. International Journal of Computational Geometry and Applications\u00a005(01n02), 37\u201351 (1995)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1145\/1989323.1989429","volume-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD 2011","author":"Y. Li","year":"2011","unstructured":"Li, Y., Li, F., Yi, K., Yao, B., Wang, M.: Flexible aggregate similarity search. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, pp. 1009\u20131020. ACM, New York (2011)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"J. Mitchell","year":"1992","unstructured":"Mitchell, J.: L\n                        1 shortest paths among polygonal obstacles in the plane. Algorithmica\u00a08(1), 55\u201388 (1992)","journal-title":"Algorithmica"},{"key":"6_CR16","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-0-387-75155-9_7","volume-title":"Algorithms in Algebraic Geometry","author":"J. Nie","year":"2008","unstructured":"Nie, J., Parrilo, P., Sturmfels, B.: Semidefinite representation of the k-ellipse. In: Algorithms in Algebraic Geometry. The IMA Volumes in Mathematics and its Applications, vol.\u00a0146, pp. 117\u2013132. Springer, New York (2008)"},{"key":"6_CR17","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: Proceedings of the 20th International Conference on Data Engineering, March-April 2, pp. 301\u2013312 (2004)"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst.\u00a030(2), 529\u2013576 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-19094-0_13","volume-title":"WALCOM: Algorithms and Computation","author":"S. Rahul","year":"2011","unstructured":"Rahul, S., Gupta, P., Janardan, R., Rajan, K.S.: Efficient top-k queries for orthogonal ranges. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol.\u00a06552, pp. 110\u2013121. Springer, Heidelberg (2011)"},{"key":"6_CR20","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1996)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R. Sproull","year":"1991","unstructured":"Sproull, R.: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica\u00a06, 579\u2013589 (1991)","journal-title":"Algorithmica"},{"key":"6_CR22","unstructured":"Wang, H., Zhang, W.: The L1 Nearest Neighbor Searching with Uncertain Queries. ArXiv e-prints (November 2012)"},{"key":"6_CR23","unstructured":"Witzgall, C.: Optimal location of a central facility: mathematical models and concepts. National Bureau of Standards (1964)"},{"issue":"6","key":"6_CR24","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"M. Yiu","year":"2005","unstructured":"Yiu, M., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineering\u00a017(6), 820\u2013833 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T12:32:03Z","timestamp":1676637123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}