{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:46:13Z","timestamp":1759682773584},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319250861"},{"type":"electronic","value":"9783319250878"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25087-8_1","type":"book-chapter","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T18:11:35Z","timestamp":1444155095000},"page":"3-14","source":"Crossref","is-referenced-by-count":16,"title":["Approximate Furthest Neighbor in High Dimensions"],"prefix":"10.1007","author":[{"given":"Rasmus","family":"Pagh","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Silvestri","sequence":"additional","affiliation":[]},{"given":"Johan","family":"Sivertsen","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Skala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abbar, S., Amer-Yahia, S., Indyk, P., Mahabadi, S.: Real-time recommendation of diverse related articles. In: Proc. 22nd International Conference on World Wide Web (WWW), pp. 1\u201312 (2013)","DOI":"10.1145\/2488388.2488390"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comgeo.2007.04.002","volume":"40","author":"M B\u0103doiu","year":"2008","unstructured":"B\u0103doiu, M., Clarkson, K.L.: Optimal core-sets for balls. Computational Geometry 40(1), 14\u201322 (2008)","journal-title":"Computational Geometry"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag TELOS (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"1_CR4","unstructured":"Bespamyatnikh, S.N.: Dynamic algorithms for approximate neighbor searching. In: Proceedings of the 8th Canadian Conference on Computational Geometry (CCCG 1996), pp. 252\u2013257. Carleton University, August 12\u201315, 1996"},{"key":"1_CR5","unstructured":"Ch\u00e1vez, E., Navarro, G.: Measuring the dimensionality of general metric spaces. Tech. Rep. TR\/DCC-00-1, Department of Computer Science, University of Chile (2000)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"KL Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las Vegas algorithms for linear and integer programming when the dimension is small. Journal of the ACM (JACM) 42(2), 488\u2013499 (1995)","journal-title":"Journal of the ACM (JACM)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proc. 20 Annual Symposium on Computational Geometry (SoCG), pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"1_CR8","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007) (online). \n                      http:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"1_CR9","unstructured":"Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 769\u2013778 (2001)"},{"key":"1_CR10","unstructured":"Indyk, P.: Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 539\u2013545 (2003)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Indyk, P., Mahabadi, S., Mahdian, M., Mirrokni, V.S.: Composable core-sets for diversity and coverage maximization. In: Proc. 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 100\u2013108. ACM (2014)","DOI":"10.1145\/2594538.2594560"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D Karger","year":"1998","unstructured":"Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. Journal of the ACM (JACM) 45(2), 246\u2013265 (1998)","journal-title":"Journal of the ACM (JACM)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/996546.996548","volume":"8","author":"P Kumar","year":"2003","unstructured":"Kumar, P., Mitchell, J.S., Yildirim, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. Journal of Experimental Algorithmics 8, 1\u20131 (2003)","journal-title":"Journal of Experimental Algorithmics"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matou\u0161ek","year":"2008","unstructured":"Matou\u0161ek, J.: On variants of the Johnson-Lindenstrauss lemma. Random Structures and Algorithms 33(2), 142\u2013156 (2008)","journal-title":"Random Structures and Algorithms"},{"issue":"4\u20135","key":"1_CR15","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\u20135), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Said, A., Fields, B., Jain, B.J., Albayrak, S.: User-centric evaluation of a k-furthest neighbor collaborative filtering recommender algorithm. In: Proc. Conference on Computer Supported Cooperative Work (CSCW), pp. 1399\u20131408 (2013)","DOI":"10.1145\/2441776.2441933"},{"key":"1_CR17","unstructured":"Said, A., Kille, B., Jain, B.J., Albayrak, S.: Increasing diversity through furthest neighbor-based recommendation. In: Proceedings of the WSDM Workshop on Diversity in Document Retrieval (DDR 2012) (2012)"},{"key":"1_CR18","unstructured":"Skala, M.A.: Aspects of Metric Spaces in Computation. Ph.D. thesis, University of Waterloo (2008)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/978-3-540-27836-8_101","volume-title":"Automata, Languages and Programming","author":"R Williams","year":"2004","unstructured":"Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1227\u20131237. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25087-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:22:50Z","timestamp":1559276570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25087-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319250861","9783319250878"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25087-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}