{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T05:10:08Z","timestamp":1746335408862,"version":"3.40.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T00:00:00Z","timestamp":1407888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s00454-014-9615-4","type":"journal-article","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T13:29:46Z","timestamp":1407850186000},"page":"366-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Volume in General Metric Spaces"],"prefix":"10.1007","volume":"52","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"}]},{"given":"Leonard J.","family":"Schulman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,13]]},"reference":[{"key":"9615_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Bartal, Y., Chan, T-H., Dhamdhere, K., Gupta, A., KLeinberg, J., Neiman, O., Slivkins, A.: Metric embeddings with relaxed guarantees. In: FOCS \u201905: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 83\u2013100. IEEE Computer Society, Washington, DC (2005)","DOI":"10.1109\/SFCS.2005.51"},{"key":"9615_CR2","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: SODA \u201907 Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2007)"},{"issue":"6","key":"9615_CR3","doi-asserted-by":"crossref","first-page":"3026","DOI":"10.1016\/j.aim.2011.08.003","volume":"228","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Advances in metric embedding theory. Adv. Math. 228(6), 3026\u20133126 (2011)","journal-title":"Adv. Math."},{"key":"9615_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, I., Bartal, Y., Neiman, O., Schulman, L.J.: Volume in general metric spaces. In: Proceedings of the 18th Annual European Conference on Algorithms: Part II, ESA\u201910, pp. 87\u201399. Springer-Verlag, Berlin (2010)","DOI":"10.1007\/978-3-642-15781-3_8"},{"issue":"1\u20132","key":"9615_CR5","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":"9615_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.-H.H., Dinitz, M., Gupta, A.: Spanners with slack. In: ESA\u201906: Proceedings of the 14th Conference on Annual European Symposium, pp. 196\u2013207. Springer-Verlag, London (2006)","DOI":"10.1007\/11841036_20"},{"key":"9615_CR7","doi-asserted-by":"crossref","unstructured":"Dinitz, M.: Compact routing with slack. In: PODC \u201907: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 81\u201388. ACM, New York (2007)","DOI":"10.1145\/1281100.1281114"},{"key":"9615_CR8","doi-asserted-by":"crossref","unstructured":"Dunagan, J., Vempala, S.: On Euclidean embeddings and bandwidth minimization. In: Lecture Notes in Computer Science, vol. 2129. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44666-4_26"},{"issue":"5","key":"9615_CR9","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ipl.2007.06.013","volume":"104","author":"M Elkin","year":"2007","unstructured":"Elkin, M., Liebchen, C., Rizzi, R.: New length bounds for cycle bases. Inform. Process. Lett. 104(5), 186\u2013193 (2007)","journal-title":"Inform. Process. Lett."},{"key":"9615_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci. 60(3), 510\u2013539 (2000) (30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998)","DOI":"10.1006\/jcss.1999.1682"},{"key":"9615_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9615_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/jagm.2000.1118","volume":"40","author":"A Gupta","year":"2001","unstructured":"Gupta, A.: Improved bandwidth approximation for trees and chordal graphs. J. Algorithms 40(1), 91\u201336 (2001)","journal-title":"J. Algorithms"},{"key":"9615_CR13","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the $$k$$ k -center problem. Math. Oper. Res. 10, 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9615_CR14","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic steiner tree problem. SIAM J. Discrete Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"9615_CR15","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s00454-003-2872-2","volume":"31","author":"R Krauthgamer","year":"2004","unstructured":"Krauthgamer, R., Linial, N., Magen, A.: Metric embeddings-beyond one-dimensional distortion. Discrete Comput. Geom. 31(3), 339\u2013356 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"9615_CR16","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, pp. 434\u2013443. IEEE, Los Alamitos (October, 2004)"},{"key":"9615_CR17","doi-asserted-by":"crossref","unstructured":"Konjevod, G., Richa, A.W., Xia, D., Yu, H.: Compact routing with slack in low doubling dimension. In: PODC \u201907: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 71\u201380. ACM, New York (2007)","DOI":"10.1145\/1281100.1281113"},{"issue":"6","key":"9615_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568322","volume":"56","author":"J Kleinberg","year":"2009","unstructured":"Kleinberg, J., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. J. ACM 56(6), 1\u201337 (2009)","journal-title":"J. ACM"},{"key":"9615_CR19","doi-asserted-by":"crossref","unstructured":"Lee, J.R.: Volume distortion for subsets of euclidean spaces. In: SCG \u201906: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, pp. 207\u2013216. ACM, New York (2006)","DOI":"10.1145\/1137856.1137888"},{"key":"9615_CR20","doi-asserted-by":"crossref","unstructured":"Rabinovich, Y.: On average distortion of embedding metrics into the line and into L1. In: STOC \u201903: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 456\u2013462. ACM Press, New York (2003)","DOI":"10.1145\/780542.780609"},{"key":"9615_CR21","doi-asserted-by":"crossref","unstructured":"Rao, S.: Small distortion and volume preserving embeddings for planar and Euclidean metrics. In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, pp. 300\u2013306. ACM, New York (1999)","DOI":"10.1145\/304893.304983"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9615-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-014-9615-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9615-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:34:06Z","timestamp":1746333246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-014-9615-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,13]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["9615"],"URL":"https:\/\/doi.org\/10.1007\/s00454-014-9615-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2014,8,13]]}}}