{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:44:10Z","timestamp":1760708650485},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,9]],"date-time":"2014-01-09T00:00:00Z","timestamp":1389225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00453-013-9864-2","type":"journal-article","created":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T17:35:42Z","timestamp":1389202542000},"page":"539-606","source":"Crossref","is-referenced-by-count":1,"title":["Local Embeddings of Metric Spaces"],"prefix":"10.1007","volume":"72","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yair","family":"Bartal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ofer","family":"Neiman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,9]]},"reference":[{"key":"9864_CR1","first-page":"83","volume-title":"Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Bartal, Y., Chan, T.-H.H., Dhamdhere Dhamdhere, K., Gupta, A., Kleinberg, J.M., Neiman, O., Slivkins, A.: Metric embeddings with relaxed guarantees. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS\u201905, Washington, DC, USA, pp.\u00a083\u2013100. IEEE Comput. Soc., Los Alamitos (2005)"},{"key":"9864_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/1132516.1132557","volume-title":"STOC\u201906: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Advances in metric embedding theory. In: STOC\u201906: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp.\u00a0271\u2013286. ACM, New York (2006)"},{"key":"9864_CR3","first-page":"502","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201907","author":"I. Abraham","year":"2007","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201907, Philadelphia, PA, USA, pp.\u00a0502\u2013511. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"9864_CR4","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/1250790.1250883","volume-title":"Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC\u201907","author":"I. Abraham","year":"2007","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Local embeddings of metric spaces. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC\u201907, New York, NY, USA, pp.\u00a0631\u2013640. ACM, New York (2007)"},{"key":"9864_CR5","first-page":"363","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201908","author":"I. Abraham","year":"2008","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Embedding metric spaces in their intrinsic dimension. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201908, Philadelphia, PA, USA, pp.\u00a0363\u2013372. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"9864_CR6","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/FOCS.2008.62","volume-title":"FOCS\u201908: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science","author":"I. Abraham","year":"2008","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: FOCS\u201908: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp.\u00a0781\u2013790. IEEE Comput. Soc., Los Alamitos (2008)"},{"key":"9864_CR7","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/1.9781611973068.95","volume-title":"SODA\u201909: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"I. Abraham","year":"2009","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: On low dimensional local embeddings. In: SODA\u201909: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp.\u00a0875\u2013884. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"9864_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(03)00227-9","volume":"273","author":"N. Alon","year":"2003","unstructured":"Alon, N.: Problems and results in extremal combinatorics. I. Discrete Math. 273, 31\u201353 (2003)","journal-title":"Discrete Math."},{"issue":"1","key":"9864_CR9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N. Alon","year":"1995","unstructured":"Alon, N., Karp, R.M., Peleg, D., West, D.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78\u2013100 (1995)","journal-title":"SIAM J. Comput."},{"key":"9864_CR10","first-page":"503","volume-title":"Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS)","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0503\u2013513 (1990)"},{"key":"9864_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/FOCS.2011.63","volume-title":"2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS)","author":"N. Bansal","year":"2011","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp.\u00a0267\u2013276 (2011)"},{"key":"9864_CR12","first-page":"184","volume-title":"37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996)","author":"Y. Bartal","year":"1996","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pp.\u00a0184\u2013193. IEEE Comput. Soc., Los Alamitos (1996)"},{"key":"9864_CR13","first-page":"183","volume-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing","author":"Y. Bartal","year":"1998","unstructured":"Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp.\u00a0183\u2013193 (1998)"},{"key":"9864_CR14","first-page":"89","volume-title":"12th Annual European Symposium on Algorithms","author":"Y. Bartal","year":"2004","unstructured":"Bartal, Y.: Graph decomposition lemmas and their role in metric embedding methods. In: 12th Annual European Symposium on Algorithms, pp.\u00a089\u201397 (2004)"},{"key":"9864_CR15","unstructured":"Bartal, Y.: Metric Ramsey decompositions and their applications. Manuscript (2007)"},{"key":"9864_CR16","first-page":"664","volume-title":"SODA\u201904: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Y. Bartal","year":"2004","unstructured":"Bartal, Y., Mendel, M.: Dimension reduction for ultrametrics. In: SODA\u201904: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0664\u2013665. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"9864_CR17","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1145\/258533.258667","volume-title":"STOC\u201997: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","author":"Y. Bartal","year":"1997","unstructured":"Bartal, Y., Blum, A., Burch, C., Tomkins, A.: A polylog(n)-competitive algorithm for metrical task systems. In: STOC\u201997: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp.\u00a0711\u2013719. ACM, New York (1997)"},{"key":"9864_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejc.2003.08.003","volume":"25","author":"Y. Bartal","year":"2004","unstructured":"Bartal, Y., Linial, N., Mendel, M., Naor, A.: Low dimensional embeddings of ultrametrics. Eur. J. Comb. 25, 87\u201392 (2004)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"9864_CR19","doi-asserted-by":"crossref","first-page":"643","DOI":"10.4007\/annals.2005.162.643","volume":"162","author":"Y. Bartal","year":"2005","unstructured":"Bartal, Y., Linial, N., Mendel, M., Naor, A.: On metric Ramsey-type phenomena. Ann. Math. 162(2), 643\u2013709 (2005)","journal-title":"Ann. Math."},{"key":"9864_CR20","volume-title":"SODA\u201911: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Y. Bartal","year":"2011","unstructured":"Bartal, Y., Recht, B., Schulman, L.J.: Dimensionality reduction: beyond the Johnson-Lindenstrauss bound. In: SODA\u201911: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (2011)"},{"key":"9864_CR21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","volume":"2","author":"J. Beck","year":"1991","unstructured":"Beck, J.: An algorithmic approach to the Lov\u00e0sz local lemma.\u00a0I. Random Struct. Algorithms 2, 343\u2013366 (1991)","journal-title":"Random Struct. Algorithms"},{"issue":"6","key":"9864_CR22","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M. Belkin","year":"2003","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15(6), 1373\u20131396 (2003)","journal-title":"Neural Comput."},{"key":"9864_CR23","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press\/Harcourt Brace Jovanovich, London (1978)"},{"issue":"1\u20132","key":"9864_CR24","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BF02776078","volume":"52","author":"J. Bourgain","year":"1985","unstructured":"Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hilbert space. Isr. J. Math. 52(1\u20132), 46\u201352 (1985)","journal-title":"Isr. J. Math."},{"key":"9864_CR25","first-page":"8","volume-title":"Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"G. Calinescu","year":"2001","unstructured":"Calinescu, G., Karloff, H., Rabani, Y.: Approximation algorithms for the 0-extension problem. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201901, Philadelphia, PA, USA, pp.\u00a08\u201316. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"key":"9864_CR26","doi-asserted-by":"crossref","first-page":"2487","DOI":"10.1137\/070712080","volume":"39","author":"M. Charikar","year":"2010","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Local global tradeoffs in metric embeddings. SIAM J. Comput. 39, 2487\u20132512 (2010)","journal-title":"SIAM J. Comput."},{"key":"9864_CR27","first-page":"178","volume-title":"24th International Conference on Distributed Computing Systems","author":"M. Costa","year":"2004","unstructured":"Costa, M., Castro, M., Rowstron, A.I.T., Key, P.B.: Pic: practical Internet coordinates for distance estimation. In: 24th International Conference on Distributed Computing Systems, pp.\u00a0178\u2013187 (2004)"},{"key":"9864_CR28","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/1060590.1060665","volume-title":"STOC\u201905: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing","author":"M. Elkin","year":"2005","unstructured":"Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: STOC\u201905: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp.\u00a0494\u2013503. ACM, New York (2005)"},{"key":"9864_CR29","first-page":"36","volume-title":"RANDOM-APPROX","author":"J. Fakcharoenphol","year":"2003","unstructured":"Fakcharoenphol, J., Talwar, K.: An improved decomposition theorem for graphs excluding a fixed minor. In: RANDOM-APPROX, pp.\u00a036\u201346 (2003)"},{"key":"9864_CR30","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1145\/780542.780608","volume-title":"STOC\u201903: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing","author":"J. Fakcharoenphol","year":"2003","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC\u201903: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp.\u00a0448\u2013455. ACM, New York (2003)"},{"key":"9864_CR31","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1002\/j.1538-7305.1952.tb01393.x","volume":"31","author":"E.N. Gilbert","year":"1952","unstructured":"Gilbert, E.N.: A comparison of signalling alphabets. Bell Syst. Tech. J. 31, 504\u2013522 (1952)","journal-title":"Bell Syst. Tech. J."},{"key":"9864_CR32","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/1.9781611973082.69","volume-title":"Proceedings of the Twenty Second Annual ACM-SIAM Symposium on Discrete Algorithms","author":"L.-A. Gottlieb","year":"2011","unstructured":"Gottlieb, L.-A., Krauthgamer, R.: A nonlinear approach to dimension reduction. In: Proceedings of the Twenty Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0888\u2013899 (2011)"},{"key":"9864_CR33","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1109\/SFCS.2003.1238226","volume-title":"FOCS\u201903: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: FOCS\u201903: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, p.\u00a0534. IEEE Comput. Soc., Los Alamitos (2003)"},{"issue":"5","key":"9864_CR34","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S. Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148\u20131184 (2006)","journal-title":"SIAM J. Comput."},{"key":"9864_CR35","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/SFCS.2001.959878","volume-title":"Proceedings of the 42nd Annual Symposium on Foundations of Computer Science","author":"P. Indyk","year":"2001","unstructured":"Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp.\u00a010\u201333 (2001)"},{"issue":"3","key":"9864_CR36","doi-asserted-by":"crossref","DOI":"10.1145\/1273340.1273347","volume":"3","author":"P. Indyk","year":"2007","unstructured":"Indyk, P., Naor, A.: Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms 3(3), 31 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"9864_CR37","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume-title":"Conference in Modern Analysis and Probability (New Haven, Conn., 1982)","author":"W.B. Johnson","year":"1984","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conference in Modern Analysis and Probability (New Haven, Conn., 1982), pp.\u00a0189\u2013206. Amer. Math. Soc., Providence (1984)"},{"key":"9864_CR38","first-page":"682","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","author":"P. Klein","year":"1993","unstructured":"Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC\u201993, New York, NY, USA, pp.\u00a0682\u2013690. ACM, New York (1993)"},{"key":"9864_CR39","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/335305.335325","volume-title":"STOC\u201900: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: STOC\u201900: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp.\u00a0163\u2013170. ACM, New York (2000)"},{"key":"9864_CR40","first-page":"444","volume-title":"FOCS","author":"J.M. Kleinberg","year":"2004","unstructured":"Kleinberg, J.M., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. In: FOCS, pp.\u00a0444\u2013453 (2004)"},{"key":"9864_CR41","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/FOCS.2004.41","volume-title":"45th Annual IEEE Symposium on Foundations of Computer Science","author":"R. Krauthgamer","year":"2004","unstructured":"Krauthgamer, R., Lee, J.R., Mendel, M., Naor, A.: Measured descent: a new embedding method for finite metrics. In: 45th Annual IEEE Symposium on Foundations of Computer Science, October 2004, pp.\u00a0434\u2013443. IEEE Press, New York (2004)"},{"key":"9864_CR42","doi-asserted-by":"crossref","first-page":"11623","DOI":"10.1073\/pnas.0503018102","volume":"102","author":"D. Liben-Nowell","year":"2005","unstructured":"Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. Proc. Natl. Acad. Sci. USA 102, 11623\u201311628 (2005)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9864_CR43","first-page":"589","volume":"31","author":"J. Matou\u0161ek","year":"1990","unstructured":"Matou\u0161ek, J.: Note on bi-Lipschitz embeddings into low-dimensional Euclidean spaces. Comment. Math. Univ. Carol. 31, 589\u2013600 (1990)","journal-title":"Comment. Math. Univ. Carol."},{"key":"9864_CR44","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02773799","volume":"102","author":"J. Matou\u0161ek","year":"1997","unstructured":"Matou\u0161ek, J.: On embedding expanders into l p spaces. Isr. J. Math. 102, 189\u2013197 (1997)","journal-title":"Isr. J. Math."},{"issue":"2","key":"9864_CR45","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.aim.2003.12.001","volume":"189","author":"M. Mendel","year":"2004","unstructured":"Mendel, M., Naor, A.: Euclidean quotients of finite metric spaces. Adv. Math. 189(2), 451\u2013494 (2004)","journal-title":"Adv. Math."},{"key":"9864_CR46","first-page":"109","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Mendel","year":"2006","unstructured":"Mendel, M., Naor, A.: Ramsey partitions and proximity data structures. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp.\u00a0109\u2013118. IEEE Comput. Soc., Los Alamitos (2006)"},{"key":"9864_CR47","first-page":"343","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"R.A. Moser","year":"2009","unstructured":"Moser, R.A.: A constructive proof of the Lov\u00e1sz local lemma. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC\u201909, New York, NY, USA, pp.\u00a0343\u2013350. ACM, New York (2009)"},{"issue":"2","key":"9864_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1667053.1667060","volume":"57","author":"R.A. Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM 57(2), 1\u201315 (2010)","journal-title":"J. ACM"},{"key":"9864_CR49","series-title":"Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)"},{"key":"9864_CR50","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/304893.304983","volume-title":"Proceedings of the Fifteenth Annual Symposium on Computational Geometry","author":"S. Rao","year":"1999","unstructured":"Rao, S.: Small distortion and volume preserving embeddings for planar and Euclidean metrics. In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, New York, pp.\u00a0300\u2013306. ACM, New York (1999)"},{"key":"9864_CR51","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s00454-008-9068-8","volume":"41","author":"G. Schechtman","year":"2009","unstructured":"Schechtman, G., Shraibman, A.: Lower bounds for local versions of dimension reductions. Discrete Comput. Geom. 41, 273\u2013283 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9864_CR52","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1145\/1143844.1143975","volume-title":"ICML\u201906: Proceedings of the 23rd International Conference on Machine Learning","author":"L. Xiao","year":"2006","unstructured":"Xiao, L., Sun, J., Boyd, S.: A duality view of spectral methods for dimensionality reduction. In: ICML\u201906: Proceedings of the 23rd International Conference on Machine Learning, New York, NY, USA, pp.\u00a01041\u20131048. ACM, New York (2006)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9864-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9864-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9864-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:58:42Z","timestamp":1565053122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9864-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,9]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9864"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9864-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,9]]}}}