{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:41Z","timestamp":1725511781646},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_14","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"157-162","source":"Crossref","is-referenced-by-count":0,"title":["Hard Metrics from Cayley Graphs of Abelian Groups"],"prefix":"10.1007","author":[{"given":"Ilan","family":"Newman","sequence":"first","affiliation":[]},{"given":"Yuri","family":"Rabinovich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","first-page":"553","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC\u201905","author":"S. Arora","year":"2005","unstructured":"Arora, S., Lee, J., Naor, A.: Euclidean distortion and the sparsest cut. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC\u201905, pp. 553\u2013562. ACM Press, New York (2005)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/rsa.3240050203","volume":"5","author":"N. Alon","year":"1994","unstructured":"Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Structures Appl.\u00a05, 271\u2013284 (1994)","journal-title":"Random Structures Appl."},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539794285983","volume":"27","author":"Y. Aumann","year":"1998","unstructured":"Aumann, Y., Rabani, Y.: An O(logk) Approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing\u00a027(1), 291\u2013301 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF02776078","volume":"52","author":"J. Bourgain","year":"1985","unstructured":"Bourgain, J.: On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel Journal of Mathematics\u00a052(1-2), 46\u201352 (1985)","journal-title":"Israel Journal of Mathematics"},{"key":"14_CR5","first-page":"102","volume-title":"Proceedings of the 16\u2019th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201905","author":"S. Chawla","year":"2005","unstructured":"Chawla, S., Gupta, A., R\u00e4cke, H.: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In: Proceedings of the 16\u2019th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201905, pp. 102\u2013111. ACM Press, New York (2005)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.: Bounded Geometries, Fractals, and Low-Distortion Embeddings. In: Proceedings of the 44th Annual Symposium on Foundations of CS, FOCS\u201903, pp. 534\u2013543 (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J. Justesen","year":"1972","unstructured":"Justesen, J.: A class of constructive asymptotically good algebraic codes. IEEE Transactions on Information\u00a018, 652\u2013656 (1972)","journal-title":"IEEE Transactions on Information"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Khot, S., Naor, A.: Nonembeddability theorems via Fourier analysis. In: Proceedings of 46th Annual Symposium of FOCS 2005, pp. 101\u2013112 (2005)","DOI":"10.1109\/SFCS.2005.54"},{"key":"14_CR9","first-page":"682","volume-title":"Proceedings of the\u00a025th\u00a0Annual ACM Symposium on Theory of Computing","author":"P. Klein","year":"1993","unstructured":"Klein, P., Plotkin, S., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the\u00a025th\u00a0Annual ACM Symposium on Theory of Computing, pp. 682\u2013690. ACM Press, New York (1993)"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica\u00a015(2), 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"14_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matousek","year":"2002","unstructured":"Matousek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"N. Linial","year":"2006","unstructured":"Linial, N., Wigderson, A.: Expander Graphs and their Applications. Bulletin of the American Math.\u00a0Society\u00a043(4), 439\u2013561 (2006)","journal-title":"Bulletin of the American Math.\u00a0Society"},{"key":"14_CR13","unstructured":"Wigderson, A., Xiao, D.: Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications. In: Electronic Colloquium on Computational Complexity, Report TR06-105, 13th Year, 105th Report"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:32:08Z","timestamp":1620016328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_14","relation":{},"subject":[]}}