{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T12:40:13Z","timestamp":1751719213915,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"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-94776-1_56","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"675-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Geometric Spanners in the MapReduce Model"],"prefix":"10.1007","author":[{"given":"Sepideh","family":"Aghamolaei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatemeh","family":"Baharifard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Fox, K., Munagala, K., Nath, A.: Parallel algorithms for constructing range and nearest-neighbor searching data structures. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 429\u2013440. ACM (2016)","DOI":"10.1145\/2902251.2902303"},{"key":"56_CR2","first-page":"1","volume":"52","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. Comb. Comput. Geom. 52, 1\u201330 (2005)","journal-title":"Comb. Comput. Geom."},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 574\u2013583 (2014)","DOI":"10.1145\/2591796.2591805"},{"key":"56_CR4","unstructured":"Bakhshesh, D., Farshi, M.: Geometric spanners merging and its applications. In: Proceedings of the 28th Canadian Conference on Computational Geometry, pp. 133\u2013139 (2016)"},{"key":"56_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-642-40047-6_66","volume-title":"Euro-Par 2013 Parallel Processing","author":"M Birn","year":"2013","unstructured":"Birn, M., Osipov, V., Sanders, P., Schulz, C., Sitchinava, N.: Efficient parallel and external matching. In: Wolf, F., Mohr, B., an Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 659\u2013670. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40047-6_66"},{"key":"56_CR6","unstructured":"Callahan, P.B.: Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, Johns Hopkins University (1995)"},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51, 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"Eldawy, A., Li, Y., Mokbel, M.F., Janardan, R.: CG$$\\_$$Hadoop: computational geometry in MapReduce. In: Proceedings 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 294\u2013303 (2013)","DOI":"10.1145\/2525314.2525349"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Eldawy, A., Mokbel, M.F.: Communication steps for parallel query processing. In: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 273\u2013284 (2013)","DOI":"10.1145\/2463664.2465224"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Eldawy, A., Mokbel, M.F.: SpatialHadoop: A MapReduce framework for spatial data. In: Proceedings of the 31st International Conference on Data Engineering, pp. 1352\u20131363 (2015)","DOI":"10.1109\/ICDE.2015.7113382"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0166-218X(03)00259-2","volume":"137","author":"AM Farley","year":"2004","unstructured":"Farley, A.M., Proskurowski, A., Zappala, D., Windisch, K.: Spanners and message distribution in networks. Discrete Appl. Math. 137, 159\u2013171 (2004)","journal-title":"Discrete Appl. Math."},{"key":"56_CR12","unstructured":"Ghodsi, M., Sack, J.: A coarse grained solution to parallel terrain simplification. In: Proceedings of 10th Canadian Conference on Computational Geometry (1998)"},{"key":"56_CR13","unstructured":"Goodrich, M.T.: Simulating parallel algorithms in the MapReduce framework with applications to parallel computational geometry. arXiv preprint arXiv:1004.4708 (2010)"},{"key":"56_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-25591-5_39","volume-title":"Algorithms and Computation","author":"Michael T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the MapReduce framework. In: Proceedings of the 22nd Annual International Symposium on Algorithms and Computation, pp. 374\u2013383 (2011)"},{"key":"56_CR15","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B., Sun, X.: Efficient massively parallel methods for dynamic programming. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 798\u2013811. ACM (2017)","DOI":"10.1145\/3055399.3055460"},{"key":"56_CR16","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1137\/1.9781611973075.76","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Howard Karloff","year":"2010","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms, pp. 938\u2013948 (2010)"},{"key":"56_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"56_CR18","doi-asserted-by":"crossref","unstructured":"Nath, A., Fox, K., Munagala, K., Agarwal, P.K.: Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains. In: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (2016)","DOI":"10.1145\/2996913.2996952"},{"key":"56_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45735-6_26","volume-title":"String Processing and Information Retrieval","author":"G Navarro","year":"2002","unstructured":"Navarro, G., Paredes, R., Ch\u00e1vez, E.: t-spanners as a data structure for metric space searching. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 298\u2013309. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45735-6_26"},{"key":"56_CR20","doi-asserted-by":"crossref","unstructured":"Rao, S.B., Smith, W.D.: Approximating geometrical graphs via \u201cspanners\u201d and \u201cbanyans\u201d. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 540\u2013550 (1998)","DOI":"10.1145\/276698.276868"},{"key":"56_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-63774-5_95","volume-title":"SOFSEM 1997: Theory and Practice of Informatics","author":"M van Kreveld","year":"1997","unstructured":"van Kreveld, M.: Algorithms for triangulated terrains. In: Pl\u00e1\u0161il, F., Jeffery, K.G. (eds.) SOFSEM 1997. LNCS, vol. 1338, pp. 19\u201336. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63774-5_95"},{"key":"56_CR22","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1137\/110832458","volume":"42","author":"G Xia","year":"2013","unstructured":"Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comput. 42, 1620\u20131659 (2013)","journal-title":"SIAM J. Comput."},{"key":"56_CR23","unstructured":"Yaroslavtsev, G., Vadapalli, A.: Massively parallel algorithms and hardness for single-linkage clustering under $$\\ell_p$$-distances. arXiv preprint arXiv:1710.01431 (2017)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T12:12:22Z","timestamp":1751717542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}