{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:28Z","timestamp":1725563548402},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157806"},{"type":"electronic","value":"9783642157813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15781-3_8","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T07:40:03Z","timestamp":1283326803000},"page":"87-99","source":"Crossref","is-referenced-by-count":1,"title":["Volume in General Metric Spaces"],"prefix":"10.1007","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","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/SFCS.2005.51","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., Neiman, O., Slivkins, A.: Metric embeddings with relaxed guarantees. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 83\u2013100. IEEE Computer Society, Los Alamitos (2005)"},{"key":"8_CR2","first-page":"271","volume-title":"Proceedings of the 38th 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: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 271\u2013286. ACM Press, New York (2006)"},{"key":"8_CR3","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 502\u2013511 (2007)"},{"key":"8_CR4","first-page":"184","volume-title":"Proceeings of the 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: Proceeings of the 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pp. 184\u2013193. IEEE Comput. Soc. Press, Los Alamitos (1996)"},{"issue":"1-2","key":"8_CR5","doi-asserted-by":"publisher","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. Israel J. Math.\u00a052(1-2), 46\u201352 (1985)","journal-title":"Israel J. Math."},{"key":"8_CR6","first-page":"196","volume-title":"Proceedings of the 14th conference on Annual European Symposium","author":"T.-H.H. Chan","year":"2006","unstructured":"Chan, T.-H.H., Dinitz, M., Gupta, A.: Spanners with slack. In: Proceedings of the 14th conference on Annual European Symposium, London, UK, pp. 196\u2013207. Springer, Heidelberg (2006)"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/1281100.1281114","volume-title":"Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing","author":"M. Dinitz","year":"2007","unstructured":"Dinitz, M.: Compact routing with slack. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 81\u201388. ACM, New York (2007)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44666-4_26","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"J. Dunagan","year":"2001","unstructured":"Dunagan, J., Vempala, S.: On Euclidean embeddings and bandwidth minimization. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, p. 229. Springer, Heidelberg (2001)"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","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. Information Processesing Letters\u00a0104(5), 186\u2013193 (2007)","journal-title":"Information Processesing Letters"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/jcss.1999.1682","volume":"60","author":"U. Feige","year":"2000","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci.\u00a060(3), 510\u2013539 (2000)","journal-title":"J. Comput. System Sci."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science\u00a038, 293\u2013306 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"24","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\u00a040(1), 24\u201336 (2001)","journal-title":"J. Algorithms"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res.\u00a010, 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","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.\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"8_CR15","doi-asserted-by":"publisher","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\u00a056(6), 1\u201337 (2009)","journal-title":"J. ACM"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/1281100.1281113","volume-title":"Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing","author":"G. Konjevod","year":"2007","unstructured":"Konjevod, G., Richa, A.W., Xia, D., Yu, H.: Compact routing with slack in low doubling dimension. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 71\u201380. ACM, New York (2007)"},{"key":"8_CR17","doi-asserted-by":"publisher","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, pp. 434\u2013443. IEEE, Los Alamitos (October 2004)"},{"issue":"3","key":"8_CR18","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\u2013beyond one-dimensional distortion. Discrete Comput. Geom.\u00a031(3), 339\u2013356 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/1137856.1137888","volume-title":"Proceedings of the 22nd Annual Symposium on Computational Geometry","author":"J.R. Lee","year":"2006","unstructured":"Lee, J.R.: Volume distortion for subsets of euclidean spaces. In: Proceedings of the 22nd Annual Symposium on Computational Geometry, pp. 207\u2013216. ACM, New York (2006)"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/304893.304983","volume-title":"Proceedings of the 15th 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 15th Annual Symposium on Computational Geometry, pp. 300\u2013306. ACM, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15781-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T14:56:33Z","timestamp":1636296993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15781-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157806","9783642157813"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15781-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}