{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:32Z","timestamp":1750308092683,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,5,22]],"date-time":"2005-05-22T00:00:00Z","timestamp":1116720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060701","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"747-754","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Tensor decomposition and approximation schemes for constraint satisfaction problems"],"prefix":"10.1145","author":[{"given":"W. Fernandez","family":"de la Vega","sequence":"first","affiliation":[{"name":"LRI, Universit\u00e9 de Paris-Sud, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kannan","sequence":"additional","affiliation":[{"name":"Yale, New Haven, CT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509945"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225140"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199605)8:3%3C187::AID-RSA3%3E3.0.CO;2-U"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200007)16:4%3C314::AID-RSA2%3E3.0.CO;2-E"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796443"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780550"},{"key":"e_1_3_2_1_7_1","first-page":"499","volume-title":"Proc. 15th ACM-SIAM SODA","author":"Fernandez de la Vega W.","year":"2004","unstructured":"W. Fernandez de la Vega , M. Karpinski and C. Kenyon , Approximation Schemes for Metric Bisection and Partitioning , Proc. 15th ACM-SIAM SODA ( 2004 ), pp. 499 -- 508 . W. Fernandez de la Vega, M. Karpinski and C. Kenyon, Approximation Schemes for Metric Bisection and Partitioning, Proc. 15th ACM-SIAM SODA (2004), pp. 499--508."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875528"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050052"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875531"},{"key":"e_1_3_2_1_12_1","first-page":"154","volume-title":"Proc. 40th IEEE FOCS","author":"Indyk P.","year":"1999","unstructured":"P. Indyk , A Sublinear Time Approximation Scheme for Clustering in Metric Spaces , Proc. 40th IEEE FOCS ( 1999 ), pp. 154 -- 159 . P. Indyk, A Sublinear Time Approximation Scheme for Clustering in Metric Spaces, Proc. 40th IEEE FOCS (1999), pp. 154--159."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(79)90012-4"},{"key":"e_1_3_2_1_14_1","first-page":"529","volume-title":"FOCS","author":"McSherry F.","year":"2001","unstructured":"F. McSherry , Spectral Partitioning of Random Graphs , FOCS 2001 , pp. 529 -- 537 F. McSherry, Spectral Partitioning of Random Graphs, FOCS 2001, pp.529--537"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796586"},{"key":"e_1_3_2_1_16_1","first-page":"1","volume-title":"Mathematics, arXiv: math CA\/021341","author":"Semmes S.","year":"2003","unstructured":"S. Semmes , A brief introduction to Gromov's notion of hyperbolic groups , Mathematics, arXiv: math CA\/021341 ( 2003 ), pp. 1 -- 10 . S. Semmes, A brief introduction to Gromov's notion of hyperbolic groups, Mathematics, arXiv: math CA\/021341 (2003), pp. 1--10."},{"key":"e_1_3_2_1_17_1","volume-title":"Numerical Taxonomy","author":"Sneath P. H.","year":"1973","unstructured":"P. H. Sneath and R. R. Sokal , Numerical Taxonomy , Freeman , London , 1973 . P. H. Sneath and R. R. Sokal, Numerical Taxonomy, Freeman, London, 1973."}],"event":{"name":"STOC05: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Baltimore MD USA","acronym":"STOC05"},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060701","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:55Z","timestamp":1750262875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":17,"alternative-id":["10.1145\/1060590.1060701","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060701","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}