{"id":"https://openalex.org/W1974691224","doi":"https://doi.org/10.1137/s009753970444644x","title":"The Approximability of Three-valued MAX CSP","display_name":"The Approximability of Three-valued MAX CSP","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1974691224","doi":"https://doi.org/10.1137/s009753970444644x","mag":"1974691224"},"language":"en","primary_location":{"id":"doi:10.1137/s009753970444644x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970444644x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1589225","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101920004","display_name":"Peter J\u00f6nsson","orcid":"https://orcid.org/0000-0002-5288-3330"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Jonsson","raw_affiliation_strings":["Department of Computer and Information Science University of Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science University of Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061502941","display_name":"Mikael Klasson","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Klasson","raw_affiliation_strings":["Department of Computer and Information Science University of Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science University of Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003558662","display_name":"Andrei Krokhin","orcid":"https://orcid.org/0000-0003-4373-8227"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrei Krokhin","raw_affiliation_strings":["Department of Computer Science University of Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101920004"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":6.4036,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.9695335,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"35","issue":"6","first_page":"1329","last_page":"1349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.73192298412323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7279371023178101},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5660213232040405},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5287430286407471},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5007500648498535},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4801482558250427},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4723958671092987},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.43117669224739075},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4101654887199402}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.73192298412323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7279371023178101},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5660213232040405},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5287430286407471},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5007500648498535},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4801482558250427},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4723958671092987},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.43117669224739075},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4101654887199402},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s009753970444644x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970444644x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:durham-repository.worktribe.com:1589225","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1589225","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1589225","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1589225","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W125196440","https://openalex.org/W389907844","https://openalex.org/W1546177704","https://openalex.org/W1551355021","https://openalex.org/W1561229603","https://openalex.org/W1563577400","https://openalex.org/W1571873445","https://openalex.org/W1576820654","https://openalex.org/W1967935161","https://openalex.org/W1994118705","https://openalex.org/W1999032440","https://openalex.org/W2028733517","https://openalex.org/W2038225707","https://openalex.org/W2068190866","https://openalex.org/W2084350425","https://openalex.org/W2097646889","https://openalex.org/W2105016507","https://openalex.org/W2106478922","https://openalex.org/W2111739159","https://openalex.org/W2116407296","https://openalex.org/W2117290960","https://openalex.org/W2131358503","https://openalex.org/W2134850460","https://openalex.org/W2146489710","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2486715098"],"related_works":["https://openalex.org/W2023722467","https://openalex.org/W2806052477","https://openalex.org/W2017695771","https://openalex.org/W4243835908","https://openalex.org/W1565254111","https://openalex.org/W2129131081","https://openalex.org/W2172622297","https://openalex.org/W78771200","https://openalex.org/W1526216923","https://openalex.org/W1983171306"],"abstract_inverted_index":{"In":[0,149],"the":[1,24,35,41,44,48,69,75,78,146,154,188,212,220],"maximum":[2],"constraint":[3,97],"satisfaction":[4],"problem":[5,55,124],"(MAX":[6],"CSP),":[7],"one":[8,210],"is":[9,26,56,63,81,99,139],"given":[10,32],"a":[11,31,92,168,174,206],"finite":[12,93],"collection":[13],"of":[14,21,51,72,77,95,177,182,193,211],"(possibly":[15],"weighted)":[16],"constraints":[17,73],"on":[18],"overlapping":[19],"sets":[20],"variables,":[22],"and":[23],"goal":[25],"to":[27,34,39,65,134,143],"assign":[28],"values":[29],"from":[30],"domain":[33],"variables":[36],"so":[37],"as":[38],"maximize":[40],"number":[42],"(or":[43],"total":[45],"weight,":[46],"for":[47,125,164,225],"weighted":[49],"case)":[50],"satisfied":[52],"constraints.":[53],"This":[54,185],"NP-hard":[57],"in":[58,103,157,205],"general,":[59],"and,":[60],"therefore,":[61],"it":[62],"natural":[64],"study":[66],"how":[67],"restricting":[68],"allowed":[70,96],"types":[71,98],"affects":[74],"approximability":[76],"problem.":[79,184],"It":[80,119],"known":[82],"that":[83,198],"every":[84,199],"Boolean":[85,147],"(that":[86],"is,":[87],"two-valued)":[88],"MAX":[89,136,165,202,216],"CSP":[90,166,203],"with":[91],"set":[94],"either":[100],"solvable":[101,180],"exactly":[102],"polynomial":[104],"time":[105],"or":[106],"else":[107],"APX-complete":[108],"(and":[109],"hence":[110],"can":[111,131],"have":[112],"no":[113],"polynomial-time":[114,179],"approximation":[115],"scheme":[116],"unless":[117],"P=NP).":[118],"has":[120],"been":[121],"an":[122],"open":[123],"several":[126],"years":[127],"whether":[128],"this":[129,150,158,162],"result":[130,163],"be":[132],"extended":[133],"non-Boolean":[135],"CSP,":[137],"which":[138,218],"much":[140],"more":[141],"difficult":[142],"analyze":[144],"than":[145],"case.":[148],"paper,":[151],"we":[152,172],"make":[153],"first":[155],"step":[156],"direction":[159],"by":[160],"establishing":[161],"over":[167],"three-element":[169],"domain.":[170],"Moreover,":[171],"present":[173],"simple":[175],"description":[176,186],"all":[178],"cases":[181],"our":[183],"uses":[187],"well-known":[189],"algebraic":[190],"combinatorial":[191],"property":[192],"supermodularity.":[194],"We":[195],"also":[196],"show":[197],"hard":[200,215],"three-valued":[201],"contains,":[204],"certain":[207],"specified":[208],"sense,":[209],"two":[213],"basic":[214],"CSPs":[217],"are":[219],"Maximum":[221],"k-Colorable":[222],"Subgraph":[223],"problems":[224],"k=2,3.":[226]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}