{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:07:11Z","timestamp":1761718031470},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_26","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"229-240","source":"Crossref","is-referenced-by-count":19,"title":["On Euclidean Embeddings and Bandwidth Minimization"],"prefix":"10.1007","author":[{"given":"John","family":"Dunagan","sequence":"first","affiliation":[]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"A. Blum, G. Konjevod, R. Ravi, and S. Vempala, \u201cSemi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems,\u201d Proc. 30th ACM Symposium on the Theory of Computing, 1998.","DOI":"10.1145\/276698.276717"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF02776078","volume":"52","author":"J. Bourgain","year":"1985","unstructured":"J. Bourgain, \u201cOn Lipshitz embedding of finite metric spaces in Hilbert space,\u201d Israel J. Math. 52 (1985) 46\u201352.","journal-title":"Israel J. Math."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"U. Feige, \u201cApproximating the bandwidth via volume respecting embeddings,\u201d in Proc. 30th ACM Symposium on the Theory of Computing, 1998.","DOI":"10.1145\/276698.276716"},{"key":"26_CR4","unstructured":"U. Feige, \u201cImproved analysis of the volume distortion of the random subsets embedding,\u201d Manuscript."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C. H. Papadimitriou","year":"1976","unstructured":"C. H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing, 16: 263\u2013270, 1976.","journal-title":"Computing"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"S. Rao, \u201cSmall distortion and volume preserving embeddings for planar and Euclidean metrics,\u201d Proc. of Symposium on Computational Geometry, 1999.","DOI":"10.1145\/304893.304983"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"S. Vempala, \u201cRandom Projection: A new approach to VLSI layout,\u201d Proc. of FOCS 1998.","DOI":"10.1109\/SFCS.1998.743489"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:26:21Z","timestamp":1556371581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}