{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:26:36Z","timestamp":1781713596952,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,10]],"date-time":"2013-10-10T00:00:00Z","timestamp":1381363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10115-013-0686-y","type":"journal-article","created":{"date-parts":[[2013,10,9]],"date-time":"2013-10-09T05:02:49Z","timestamp":1381294969000},"page":"319-351","source":"Crossref","is-referenced-by-count":21,"title":["Efficient processing of optimal meeting point queries in Euclidean space and road networks"],"prefix":"10.1007","volume":"42","author":[{"given":"Da","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhou","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,10,10]]},"reference":[{"key":"686_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/4002","volume-title":"Algorithms: design techniques and analysis","author":"MH Alsuwaiyel","year":"1999","unstructured":"Alsuwaiyel MH (1999) Algorithms: design techniques and analysis. World Scientific, Singapore"},{"key":"686_CR2","doi-asserted-by":"crossref","unstructured":"Beck A, Teboulle M (2009) Gradient-based algorithms with applications to signal recovery. In: Palomar D, Eldar Y (eds) Convex optimization in signal processing and communications. Cambridge University Press, Cambridge, pp 139\u2013162","DOI":"10.1017\/CBO9780511804458.003"},{"key":"686_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"issue":"6","key":"686_CR4","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1287\/opre.41.6.1153","volume":"41","author":"J Brimberg","year":"1993","unstructured":"Brimberg J, Love RF (1993) Global convergence of a generalized iterative procedure for the minisum location problem with lp distances. Oper Res 41(6):1153\u20131163","journal-title":"Oper Res"},{"key":"686_CR5","doi-asserted-by":"crossref","unstructured":"Chen R (1984) Location problems with costs being sums of powers of Euclidean distances. Comput Oper Res 11(3):285\u2013294","DOI":"10.1016\/0305-0548(84)90017-0"},{"key":"686_CR6","doi-asserted-by":"crossref","unstructured":"Chen R (1984) Solution of location problems with radial cost functions. Comput Math Appl 10(1):87\u201394","DOI":"10.1016\/0898-1221(84)90089-0"},{"issue":"5","key":"686_CR7","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32(5):1338\u20131355","journal-title":"SIAM J Comput"},{"issue":"2","key":"686_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1111\/j.1467-9787.1968.tb01323.x","volume":"8","author":"L Cooper","year":"1968","unstructured":"Cooper L (1968) An extension of the generalized weber problem. J Reg Sci 8(2):181\u2013197","journal-title":"J Reg Sci"},{"key":"686_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry","author":"M Berg De","year":"2008","unstructured":"De Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry. Springer, Berlin"},{"issue":"2","key":"686_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/TKDE.2010.230","volume":"24","author":"K Deng","year":"2012","unstructured":"Deng K, Sadiq S, Zhou X, Xu H, Fung GPC, Lu Y (2012) On group nearest group query processing. IEEE Trans Knowl Data Eng 24(2):295\u2013308","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"686_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/moor.12.2.255","volume":"12","author":"Z Drezner","year":"1987","unstructured":"Drezner Z, Shelah S (1987) On the complexity of the Elzinga-Hearn algorithm for the 1-center problem. Math Oper Res 12(2):255\u2013261","journal-title":"Math Oper Res"},{"key":"686_CR12","volume-title":"The optimal-location query. Advances in spatial and temporal databases","author":"Y Du","year":"2005","unstructured":"Du Y, Zhang D, Xia T (2005) The optimal-location query. Advances in spatial and temporal databases. Springer, Berlin"},{"issue":"4","key":"686_CR13","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin R, Lotem A, Naor M (2003) Optimal aggregation algorithms for middleware. J Comput Syst Sci 66(4):614\u2013656","journal-title":"J Comput Syst Sci"},{"key":"686_CR14","first-page":"319","volume-title":"Contraction hierarchies: faster and simpler hierarchical routing in road networks. Experimental algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: faster and simpler hierarchical routing in road networks. Experimental algorithms. Springer, Berlin, pp 319\u2013333"},{"issue":"1\u20132","key":"686_CR15","doi-asserted-by":"crossref","first-page":"747","DOI":"10.14778\/1920841.1920936","volume":"3","author":"G Kellaris","year":"2010","unstructured":"Kellaris G, Mouratidis K (2010) Shortest path computation on air indexes. Proc VLDB Endow 3(1\u20132):747\u2013757","journal-title":"Proc VLDB Endow"},{"key":"686_CR16","doi-asserted-by":"crossref","unstructured":"Leutenegger ST, Lopez MA, Edgington J (1997) STR: a simple and efficient algorithm for R-tree packing. In: IEEE 13th international conference on data engineering (ICDE), April 1997, pp 497\u2013506","DOI":"10.1109\/ICDE.1997.582015"},{"key":"686_CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/11535331_16","volume-title":"On trip planning queries in spatial databases. Advances in spatial and temporal databases","author":"F Li","year":"2005","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. Advances in spatial and temporal databases. Springer, Berlin, pp 273\u2013290"},{"key":"686_CR18","doi-asserted-by":"crossref","unstructured":"Li F, Yao B, Kumar P (2011) Group enclosing queries. IEEE Trans Knowl Data Eng 23(10):1526\u20131540","DOI":"10.1109\/TKDE.2010.181"},{"key":"686_CR19","doi-asserted-by":"crossref","unstructured":"Li Y, Li F, Yi K, Yao B, Wang M (2011) Flexible aggregate similarity search. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, June 2011, pp 1009\u20131020","DOI":"10.1145\/1989323.1989429"},{"key":"686_CR20","unstructured":"Li J, Yiu ML, Mamoulis N (2013) Efficient notification of meeting points for moving groups via independent safe regions. In: IEEE 29th international conference on data engineering (ICDE), 2013, pp 422\u2013433"},{"issue":"6","key":"686_CR21","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1109\/TKDE.2008.41","volume":"20","author":"X Lian","year":"2008","unstructured":"Lian X, Chen L (2008) Probabilistic group nearest neighbor queries in uncertain databases. IEEE Trans Knowl Data Eng 20(6):809\u2013824","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"686_CR22","doi-asserted-by":"crossref","unstructured":"Megiddo N (1982) Linear-time algorithms for linear programming in R3 and related problems. In: Proceedings of 23rd annual IEEE symposium on foundations of computer science, November 1982, pp 329\u2013338","DOI":"10.1109\/SFCS.1982.24"},{"key":"686_CR23","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the 29th international conference on very large data bases, Volume 29. VLDB Endowment, Sept 2003, pp 802\u2013813"},{"issue":"3","key":"686_CR24","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1111\/j.1467-9787.1977.tb00511.x","volume":"17","author":"LM Ostresh","year":"1977","unstructured":"Ostresh LM (1977) The multifacility location problem: applications and descent theorems. J Reg Sci 17(3):409\u2013419","journal-title":"J Reg Sci"},{"key":"686_CR25","unstructured":"Papadias D, Shen Q, Tao Y, Mouratidis K Group nearest neighbor queries. In: IEEE 20th international conference on data engineering (ICDE), March 2004, pp 301\u2013312"},{"issue":"2","key":"686_CR26","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. ACM Trans Database Syst (TODS) 30(2):529\u2013576","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"686_CR27","doi-asserted-by":"crossref","unstructured":"Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, June 2008, pp 43\u201354","DOI":"10.1145\/1376616.1376623"},{"issue":"1","key":"686_CR28","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.14778\/1687627.1687763","volume":"2","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. Proc VLDB Endow 2(1):1210\u20131221","journal-title":"Proc VLDB Endow"},{"key":"686_CR29","unstructured":"Shamos MI, Hoey D (1975) Closest point problems. In: Proceedings of 16th annual IEEE symposium on foundations of computer science, Oct 1975, pp 151\u2013162"},{"issue":"1","key":"686_CR30","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/69.567054","volume":"9","author":"S Shekhar","year":"1997","unstructured":"Shekhar S, Liu DR (1997) CCAM: a connectivity-clustered access method for networks and network computations. IEEE Trans Knowl Data Eng 9(1):102\u2013119","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"686_CR31","doi-asserted-by":"crossref","unstructured":"Tao Y, Sheng C, Pei J (2011) On $$k$$ k -skip shortest paths. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, June 2011, pp 421\u2013432","DOI":"10.1145\/1989323.1989368"},{"issue":"4","key":"686_CR32","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0166-0462(82)90004-7","volume":"12","author":"GO Wesolowsky","year":"1982","unstructured":"Wesolowsky GO (1982) Location problems on a sphere. Reg Sci Urban Econ 12(4):495\u2013508","journal-title":"Reg Sci Urban Econ"},{"issue":"1","key":"686_CR33","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.14778\/1687627.1687754","volume":"2","author":"RCW Wong","year":"2009","unstructured":"Wong RCW, \u00d6zsu MT, Yu PS, Fu AWC, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. Proc VLDB Endow 2(1):1126\u20131137","journal-title":"Proc VLDB Endow"},{"key":"686_CR34","doi-asserted-by":"crossref","unstructured":"Xiao X, Yao B, Li F (2011) Optimal location queries in road network databases. In: IEEE 27th international conference on data engineering (ICDE), April 2011, pp 804\u2013815","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"686_CR35","doi-asserted-by":"crossref","unstructured":"Xu Z, Jacobsen HA (2010) Processing proximity relations in road networks. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, June 2010, pp 243\u2013254","DOI":"10.1145\/1807167.1807196"},{"key":"686_CR36","doi-asserted-by":"crossref","unstructured":"Yan D, Zhao Z, Ng W (2011) Efficient algorithms for finding optimal meeting point on road networks. Proce VLDB Endow 4(11):968\u2013979","DOI":"10.14778\/3402707.3402734"},{"key":"686_CR37","doi-asserted-by":"crossref","unstructured":"Yan D, Wong RCW, Ng W (2011) Efficient methods for finding influential locations with adaptive grids. In: Proceedings of the 20th ACM international conference on Information and knowledge management, Oct 2011, pp 1475\u20131484","DOI":"10.1145\/2063576.2063788"},{"key":"686_CR38","unstructured":"Yan D, Cheng J, Ng W, Liu S (2013) Finding distance-preserving subgraphs in large road networks. In: IEEE 29th international conference on data engineering (ICDE), 2013, pp 625\u2013636"},{"issue":"6","key":"686_CR39","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. IEEE Trans Knowl Data Eng 17(6):820\u2013833","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0686-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0686-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0686-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T15:44:37Z","timestamp":1596642277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0686-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,10]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["686"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0686-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,10]]}}}