{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:49Z","timestamp":1746115909538,"version":"3.40.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s00454-013-9536-7","type":"journal-article","created":{"date-parts":[[2013,10,10]],"date-time":"2013-10-10T05:22:37Z","timestamp":1381382557000},"page":"977-1032","source":"Crossref","is-referenced-by-count":0,"title":["Dimension Reduction for Finite Trees in $$\\varvec{\\ell _1}$$ \u2113 1"],"prefix":"10.1007","volume":"50","author":[{"given":"James R.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"de Mesmay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Moharrami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,10]]},"reference":[{"key":"9536_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Charikar, M., Neiman, O., Nguyen, H.L.: Near linear lower bound for dimension reduction in l1. In: FOCS, pp. 315\u2013323 (2011)","DOI":"10.1109\/FOCS.2011.87"},{"issue":"5","key":"9536_CR2","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/1089023.1089026","volume":"52","author":"B Brinkman","year":"2005","unstructured":"Brinkman, B., Charikar, M.: On the impossibility of dimension reduction in $$\\ell _1$$ \u2113 1 . J. ACM 52(5), 766\u2013788 (2005)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"9536_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02392835","volume":"162","author":"J Bourgain","year":"1989","unstructured":"Bourgain, J., Lindenstrauss, J., Milman, V.: Approximation of zonoids by zonotopes. Acta Math. 162(1\u20132), 73\u2013141 (1989)","journal-title":"Acta Math."},{"issue":"6","key":"9536_CR4","doi-asserted-by":"crossref","first-page":"1704","DOI":"10.1137\/090772873","volume":"41","author":"JD Batson","year":"2012","unstructured":"Batson, J.D., Spielman, D.A., Srivastava, N.: Twice-Ramanujan sparsifiers. SIAM J. Comput. 41(6), 1704\u20131721 (2012)","journal-title":"SIAM J. Comput."},{"key":"9536_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Sahai, A.: Dimension reduction in the $$\\ell _1$$ \u2113 1 norm. In: FOCS, pp. 551\u2013560 (2002)","DOI":"10.1109\/SFCS.2002.1181979"},{"key":"9536_CR6","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Infinite and Finite Sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), vol. II, pp. 609\u2013627. Colloquium Mathematical Society J\u00e1nos Bolyai, vol. 10. North-Holland, Amsterdam (1975)"},{"key":"9536_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: FOCS, pp. 534\u2013543 (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"9536_CR8","doi-asserted-by":"crossref","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conference in Modern Analysis and Probability (New Haven, CT, 1982), Contemporary Mathematics, vol. 26, pp. 189\u2013206. American Mathematical Society, Providence (1984)","DOI":"10.1090\/conm\/026\/737400"},{"key":"9536_CR9","doi-asserted-by":"crossref","unstructured":"Lee, J.R., de Mesmay, A., Moharrami, M.: Dimension reduction for finite trees in $$l_{1}$$ l 1 . In: SODA, pp. 43\u201350 (2012)","DOI":"10.1137\/1.9781611973099.4"},{"issue":"4","key":"9536_CR10","first-page":"745","volume":"14","author":"JR Lee","year":"2004","unstructured":"Lee, J.R., Naor, A.: Embedding the diamond graph in $$L_{p}$$ L p and dimension reduction in $$L_{1}$$ L 1 . Geom. Funct. Anal. 14(4), 745\u2013747 (2004)","journal-title":"Geom. Funct. Anal."},{"issue":"5","key":"9536_CR11","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1007\/s00039-008-0689-0","volume":"18","author":"JR Lee","year":"2009","unstructured":"Lee, J.R., Naor, A., Peres, Y.: Trees and Markov convexity. Geom. Funct. Anal. 18(5), 1609\u20131659 (2009)","journal-title":"Geom. Funct. Anal."},{"key":"9536_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02785579","volume":"114","author":"J Matou\u0161ek","year":"1999","unstructured":"Matou\u0161ek, J.: On embedding trees into uniformly convex Banach spaces. Israel J. Math. 114, 221\u2013237 (1999)","journal-title":"Israel J. Math."},{"key":"9536_CR13","unstructured":"Matou\u0161ek, J.: Open problems on embeddings of finite metric spaces. http:\/\/kam.mff.cuni.cz\/matousek\/haifaop.ps (2002)"},{"key":"9536_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms and Combinations","author":"C McDiarmid","year":"1998","unstructured":"McDiarmid, C.: Concentration. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms and Combinations, vol. 16, pp. 195\u2013248. Springer, Berlin (1998)"},{"key":"9536_CR15","unstructured":"Newman, I., Rabinovich, Y.: On cut dimension of $$\\ell _1$$ \u2113 1 metrics and volumes, and related sparsification techniques. CoRR. http:\/\/CoRR\/abs\/1002.3541 (2010)"},{"key":"9536_CR16","unstructured":"Regev, O.: Entropy-based bounds on dimension reduction in $$L_1$$ L 1 . Israel J. Math. http:\/\/arxiv\/abs\/1108.1283 (2011)"},{"issue":"2","key":"9536_CR17","first-page":"159","volume":"61","author":"G Schechtman","year":"1987","unstructured":"Schechtman, G.: More on embedding subspaces of $$L_p$$ L p in $$l^{n}_{r}$$ l r n . Compos. Math. 61(2), 159\u2013169 (1987)","journal-title":"Compos. Math."},{"key":"9536_CR18","unstructured":"Schulman, L.J.: Coding for interactive communication. IEEE Trans. Inform. Theory 42(6, part 1), 1745\u20131756 (1996). Codes and complexity"},{"issue":"2","key":"9536_CR19","first-page":"363","volume":"108","author":"M Talagrand","year":"1990","unstructured":"Talagrand, M.: Embedding subspaces of $$L_1$$ L 1 into $$l^N_1$$ l 1 N . Proc. Am. Math. Soc. 108(2), 363\u2013369 (1990)","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9536-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9536-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9536-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T16:24:45Z","timestamp":1746030285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9536-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,10]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9536"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9536-7","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2013,10,10]]}}}