{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:47Z","timestamp":1725490247711},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742074"},{"type":"electronic","value":"9783540742081"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74208-1_16","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T10:52:26Z","timestamp":1188211946000},"page":"218-227","source":"Crossref","is-referenced-by-count":3,"title":["Hardness of Embedding Metric Spaces of Equal Size"],"prefix":"10.1007","author":[{"given":"Subhash","family":"Khot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rishi","family":"Saket","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean Traveling Salesman and other Geometric problems. Journal of the ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motawani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. In: Proc. STOC, pp. 553\u2013562 (2005)","DOI":"10.1145\/1060590.1060673"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. In: Proc. STOC, pp. 222\u2013231 (2004)","DOI":"10.1145\/1007352.1007355"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"Journal of the ACM"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Badoiu, M., Chuzhoy, J., Indyk, P., Sidiropoulos, A.: Low-distortion embeddings of general metrics into the line. In: Proc. STOC, pp. 225\u2013233 (2005)","DOI":"10.1145\/1060590.1060624"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: On approximating arbitrary metrices by tree metrics. In: Proc. STOC, pp. 161\u2013168 (1998)","DOI":"10.1145\/276698.276725"},{"key":"16_CR8","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 metrics in Hilbert space. Israel Journal of Mathematics\u00a052, 46\u201352 (1985)","journal-title":"Israel Journal of Mathematics"},{"key":"16_CR9","unstructured":"Chekuri, C., Khanna, S., Naor, J., Zosin, L.: Approximation algorithms for the metric labeling problem via a new linear programming formulation. In: Proc. SODA, pp. 109\u2013118 (2001)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Naor, J.: The hardness of Metric Labeling. In: Proc. FOCS, pp. 108\u2013114 (2004)","DOI":"10.1109\/FOCS.2004.67"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J. Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci.\u00a069(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithmic applications of low-distortion embeddings. In: Proc. FOCS, pp. 10\u201333 (2001)","DOI":"10.1109\/SFCS.2001.959878"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"J. Kleinberg","year":"2002","unstructured":"Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. Journal of the ACM\u00a049, 616\u2013630 (2002)","journal-title":"Journal of the ACM"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Rabani, Y., Sinclair, A.: Low distortion maps between point sets. In: Proc. STOC, pp. 272\u2013280 (2004)","DOI":"10.1145\/1007352.1007398"},{"key":"16_CR15","unstructured":"Papadimitriou, C.H., Safra, S.: The complexity of low-distortion embeddings between point sets. In: Proc. SODA, pp. 112\u2013118 (2005)"}],"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\/978-3-540-74208-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:32:23Z","timestamp":1550874743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74208-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742074","9783540742081"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74208-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}