{"id":"https://openalex.org/W2091694652","doi":"https://doi.org/10.1145/2090236.2090274","title":"Linear programming, width-1 CSPs, and robust satisfaction","display_name":"Linear programming, width-1 CSPs, and robust satisfaction","publication_year":2012,"publication_date":"2012-01-08","ids":{"openalex":"https://openalex.org/W2091694652","doi":"https://doi.org/10.1145/2090236.2090274","mag":"2091694652"},"language":"en","primary_location":{"id":"doi:10.1145/2090236.2090274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2090236.2090274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","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/A5113480885","display_name":"G\u00e1bor Kun","orcid":null},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gabor Kun","raw_affiliation_strings":["Institute for Advanced Study, and DIMACS"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, and DIMACS","institution_ids":["https://openalex.org/I2799411422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051167298","display_name":"Ryan O\u2019Donnell","orcid":"https://orcid.org/0009-0005-5609-5795"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan O'Donnell","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112486227","display_name":"Suguru Tamaki","orcid":"https://orcid.org/0000-0002-8105-2368"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Suguru Tamaki","raw_affiliation_strings":["Kyoto University"],"affiliations":[{"raw_affiliation_string":"Kyoto University","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["Kyoto University, and Preferred Infrastructure, Inc"],"affiliations":[{"raw_affiliation_string":"Kyoto University, and Preferred Infrastructure, Inc","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045927034","display_name":"Yuan Zhou","orcid":"https://orcid.org/0009-0008-1706-6539"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuan Zhou","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5113480885"],"corresponding_institution_ids":["https://openalex.org/I2799411422"],"apc_list":null,"apc_paid":null,"fwci":8.2929,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.98158411,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"484","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8151140809059143},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.731829822063446},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6562612056732178},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5739316940307617},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5475519895553589},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5425018668174744},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.44228124618530273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4016997516155243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37908855080604553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3665204346179962},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14752459526062012},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.07653746008872986}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8151140809059143},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.731829822063446},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6562612056732178},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5739316940307617},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5475519895553589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5425018668174744},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.44228124618530273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4016997516155243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37908855080604553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3665204346179962},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14752459526062012},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.07653746008872986},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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":3,"locations":[{"id":"doi:10.1145/2090236.2090274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2090236.2090274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.796","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/%7Eodonnell/papers/width1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.309.4849","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.4849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~odonnell/papers/width1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7863975410","display_name":null,"funder_award_id":"CCF-0747250","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W142429389","https://openalex.org/W1570219696","https://openalex.org/W1975452925","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2000151313","https://openalex.org/W2026753685","https://openalex.org/W2029110781","https://openalex.org/W2040102827","https://openalex.org/W2040924621","https://openalex.org/W2066467737","https://openalex.org/W2068190866","https://openalex.org/W2094135928","https://openalex.org/W2110871651","https://openalex.org/W2116407296","https://openalex.org/W2120358419","https://openalex.org/W2124452950","https://openalex.org/W2135432705","https://openalex.org/W2150339067","https://openalex.org/W2165732281","https://openalex.org/W2172286136","https://openalex.org/W2611404581","https://openalex.org/W6605749522","https://openalex.org/W6627340123"],"related_works":["https://openalex.org/W2097415053","https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W2102858635","https://openalex.org/W1531664660","https://openalex.org/W1563755460","https://openalex.org/W1820477541","https://openalex.org/W2500041535","https://openalex.org/W1957191361","https://openalex.org/W4239133097"],"abstract_inverted_index":{"We":[0],"say":[1],"that":[2,40],"an":[3],"algorithm":[4],"robustly":[5,46],"decides":[6,47],"a":[7],"constraint":[8],"satisfaction":[9],"problem":[10],"\u03a0":[11,48,53],"if":[12,49,52],"it":[13],"distinguishes":[14],"at-least-(1":[15],"-\u03b5)-satisfiable":[16],"instances":[17,22],"from":[18],"less-than-(1":[19],"-":[20],"r(\u03b5))-satisfiable":[21],"for":[23],"some":[24],"function":[25],"r(\u03b5)":[26,28],"with":[27],"\u2192":[29,33],"0":[30],"as":[31],"\u03b5":[32],"0.":[34],"In":[35],"this":[36],"paper":[37],"we":[38],"show":[39],"the":[41,58],"canonical":[42],"linear":[43],"programming":[44],"relaxation":[45],"and":[50,62],"only":[51],"has":[54],"\"width":[55],"1\"":[56],"(in":[57],"sense":[59],"of":[60],"Feder":[61],"Vardi).":[63]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
