{"id":"https://openalex.org/W2074447841","doi":"https://doi.org/10.1145/1060590.1060701","title":"Tensor decomposition and approximation schemes for constraint satisfaction problems","display_name":"Tensor decomposition and approximation schemes for constraint satisfaction problems","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2074447841","doi":"https://doi.org/10.1145/1060590.1060701","mag":"2074447841"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060701","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048362491","display_name":"W. Fernandez de la V\u00e9ga","orcid":"https://orcid.org/0000-0002-3782-3583"},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"W. Fernandez de la Vega","raw_affiliation_strings":["LRI, Universit\u00e9 de Paris-Sud, Orsay, France"],"affiliations":[{"raw_affiliation_string":"LRI, Universit\u00e9 de Paris-Sud, Orsay, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["University of Bonn, Bonn","University of Bonn, Bonn#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"University of Bonn, Bonn#TAB#","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059436381","display_name":"Ravi Kannan","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Kannan","raw_affiliation_strings":["Yale, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Yale, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111459522","display_name":"Santosh Vempala","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santosh Vempala","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048362491"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"],"apc_list":null,"apc_paid":null,"fwci":1.3205,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.79464286,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"747","last_page":"754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7141863703727722},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6087214946746826},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5213310122489929},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.5060145258903503},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47876110672950745},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47048428654670715},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.46923142671585083},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4648496210575104},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.42567262053489685},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4230310916900635},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41482430696487427},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36536601185798645},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14026039838790894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11645975708961487},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10243716835975647}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7141863703727722},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6087214946746826},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5213310122489929},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.5060145258903503},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47876110672950745},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47048428654670715},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.46923142671585083},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4648496210575104},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.42567262053489685},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4230310916900635},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41482430696487427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36536601185798645},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14026039838790894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11645975708961487},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10243716835975647},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1060590.1060701","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.2525","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.2525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/homes/kannan/Papers/triangle.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.3121","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.3121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/ftp/reports/cs-reports/2005/85266-CS.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.5298","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.5298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.mit.edu/~vempala/papers/tensor.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.6276","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.6276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mathematics.uni-bonn.de/publications/Karpinski1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1489751291","https://openalex.org/W1605711022","https://openalex.org/W1921984393","https://openalex.org/W1970630090","https://openalex.org/W1970866964","https://openalex.org/W1976779334","https://openalex.org/W1979750072","https://openalex.org/W2004328207","https://openalex.org/W2022070138","https://openalex.org/W2027048490","https://openalex.org/W2060265828","https://openalex.org/W2065641139","https://openalex.org/W2072858942","https://openalex.org/W2082710360","https://openalex.org/W2109694798","https://openalex.org/W2122381782","https://openalex.org/W2156397150","https://openalex.org/W6600855609"],"related_works":["https://openalex.org/W2950186459","https://openalex.org/W2170114491","https://openalex.org/W2897298721","https://openalex.org/W2242624680","https://openalex.org/W2136127937","https://openalex.org/W4290987221","https://openalex.org/W2216309014","https://openalex.org/W2569661359","https://openalex.org/W3199841771","https://openalex.org/W4286971555"],"abstract_inverted_index":{"The":[0],"only":[1],"general":[2],"class":[3,30,66],"of":[4,31,70,86,93,97,110,118,135],"MAX-rCSP":[5,33,123],"problems":[6,34,42,130],"for":[7,26,44,61,129],"which":[8,35],"Polynomial":[9],"Time":[10],"Approximation":[11],"Schemes":[12],"(PTAS)":[13],"are":[14,16,74],"known":[15],"the":[17,40,52,55,91,102,120],"dense":[18,41],"problems.":[19],"In":[20],"this":[21],"paper,":[22],"we":[23,125],"give":[24,127],"PTAS's":[25,128],"a":[27,68,84,88,94,115,132],"much":[28],"larger":[29],"weighted":[32,141],"includes":[36,67],"as":[37,139],"special":[38],"cases":[39],"and,":[43],"r":[45,62],"=":[46],"2,":[47,64],"all":[48],"metric":[49],"instances":[50],"(where":[51],"weights":[53],"satisfy":[54],"triangle":[56],"inequality)":[57],"and":[58,113,144],"quasimetric":[59],"instances;":[60],">":[63],"our":[65],"generalization":[69],"metrics.":[71],"Our":[72],"algorithms":[73],"based":[75],"on":[76],"low-rank":[77],"approximations":[78],"with":[79,131],"two":[80],"novel":[81],"features:":[82],"(1)":[83],"method":[85],"approximating":[87],"tensor":[89],"by":[90],"sum":[92],"small":[95],"number":[96,134],"\"rank-1\"":[98],"tensors,":[99],"akin":[100],"to":[101],"traditional":[103],"Singular":[104],"Value":[105],"Decomposition":[106],"(this":[107],"might":[108],"be":[109],"independent":[111],"interest)":[112],"(2)":[114],"simple":[116],"way":[117],"scaling":[119],"weights.":[121],"Besides":[122],"problems,":[124],"also":[126],"constant":[133],"global":[136],"constraints":[137],"such":[138],"maximum":[140],"graph":[142],"bisection":[143],"some":[145],"generalizations.":[146]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}