{"id":"https://openalex.org/W2763725654","doi":"https://doi.org/10.4230/lipics.ipec.2015.294","title":"Complexity and Approximability of Parameterized MAX-CSPs","display_name":"Complexity and Approximability of Parameterized MAX-CSPs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2763725654","doi":"https://doi.org/10.4230/lipics.ipec.2015.294","mag":"2763725654"},"language":"en","primary_location":{"id":"pmh:oai:uni-augsburg.opus-bayern.de:87005","is_oa":true,"landing_page_url":"https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-870053","pdf_url":"https://opus.bibliothek.uni-augsburg.de/opus4/files/87005/28.pdf","source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"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":"","raw_type":"bookpart"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://opus.bibliothek.uni-augsburg.de/opus4/files/87005/28.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052689442","display_name":"Holger Dell","orcid":"https://orcid.org/0000-0001-8955-0786"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dell, Holger","raw_affiliation_strings":["Saarland University [Saarbr\u00fccken]"],"affiliations":[{"raw_affiliation_string":"Saarland University [Saarbr\u00fccken]","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Kim, Eun Jung","orcid":null},"institutions":[{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Kim, Eun Jung","raw_affiliation_strings":["Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision","institution_ids":["https://openalex.org/I4210137929"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lampis, Michael","raw_affiliation_strings":["Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision","institution_ids":["https://openalex.org/I4210137929"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034146312","display_name":"Valia Mitsou","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Mitsou, Valia","raw_affiliation_strings":["Institute for Computer Science and Control [Budapest]"],"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control [Budapest]","institution_ids":["https://openalex.org/I4210117195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041355842","display_name":"Tobias M\u00f6mke","orcid":"https://orcid.org/0000-0002-2509-6972"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M\u00f6mke, Tobias","raw_affiliation_strings":["Saarland University [Saarbr\u00fccken]"],"affiliations":[{"raw_affiliation_string":"Saarland University [Saarbr\u00fccken]","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5052689442"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.26888805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.76419997215271,"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.76419997215271,"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.1242000013589859,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.07760000228881836,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8750797510147095},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7481313347816467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7011350393295288},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6739063262939453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.627849817276001},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4812609851360321},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.47098538279533386},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4365411102771759},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4292319416999817},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41463911533355713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2775316834449768},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16420814394950867},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07574605941772461}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8750797510147095},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7481313347816467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7011350393295288},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6739063262939453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.627849817276001},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4812609851360321},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.47098538279533386},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4365411102771759},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4292319416999817},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41463911533355713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2775316834449768},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16420814394950867},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07574605941772461},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":"pmh:oai:uni-augsburg.opus-bayern.de:87005","is_oa":true,"landing_page_url":"https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-870053","pdf_url":"https://opus.bibliothek.uni-augsburg.de/opus4/files/87005/28.pdf","source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"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":"","raw_type":"bookpart"},{"id":"pmh:oai:HAL:hal-01490587v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01490587","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.294-306, ⟨10.4230/LIPIcs.IPEC.2015.294⟩","raw_type":"Conference papers"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/16353","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/16353","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},{"id":"pmh:oai:drops-oai.dagstuhl.de:5591","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.294","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.ipec.2015.294","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2015.294","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:uni-augsburg.opus-bayern.de:87005","is_oa":true,"landing_page_url":"https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-870053","pdf_url":"https://opus.bibliothek.uni-augsburg.de/opus4/files/87005/28.pdf","source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"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":"","raw_type":"bookpart"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G409001275","display_name":null,"funder_award_id":"BL511/10-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2763725654.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2113684989","https://openalex.org/W2945561475","https://openalex.org/W1531868704","https://openalex.org/W4285659194","https://openalex.org/W3031065515","https://openalex.org/W2039168577","https://openalex.org/W3048010228","https://openalex.org/W4382239723","https://openalex.org/W56447744","https://openalex.org/W2091368663"],"abstract_inverted_index":{"We":[0,66,83],"study":[1],"the":[2,11,16,21,52,55,58,63,70,90,109,138],"optimization":[3],"version":[4],"of":[5,13,24,57,62],"constraint":[6,71],"satisfaction":[7],"problems":[8],"(Max-CSPs)":[9],"in":[10,101,125],"framework":[12],"parameterized":[14],"complexity;":[15],"goal":[17],"is":[18,105,114,132],"to":[19,36,85,107],"compute":[20,108],"maximum":[22],"fraction":[23,40],"constraints":[25],"that":[26],"can":[27,98],"be":[28,99],"satisfied":[29],"simultaneously.":[30],"In":[31],"standard":[32,140],"CSPs,":[33,141],"we":[34,45,142],"want":[35],"decide":[37],"whether":[38],"this":[39],"equals":[41],"one.":[42],"The":[43,95],"parameters":[44,81],"investigate":[46],"are":[47],"structural":[48],"measures,":[49],"such":[50],"as":[51],"treewidth":[53],"or":[54],"clique-width":[56],"variable\u2013constraint":[59],"incidence":[60],"graph":[61],"CSP":[64],"instance.":[65],"consider":[67],"Max-CSPs":[68],"with":[69,79],"types":[72],"AND,":[73],"OR,":[74],"PARITY,":[75],"and":[76,78],"MAJORITY,":[77],"various":[80],"k.":[82],"attempt":[84],"fully":[86],"classify":[87],"them":[88],"into":[89],"following":[91],"three":[92],"cases:":[93],"1.":[94],"exact":[96,110],"optimum":[97],"computed":[100],"FPT-time.":[102],"2.":[103],"It":[104],"W[1]-hard":[106],"optimum,":[111],"but":[112],"there":[113],"a":[115,123],"randomized":[116],"FPT":[117,144],"approximation":[118],"scheme":[119],"(FPT-AS),":[120],"which":[121],"computes":[122],"(1-epsilon)-approximation":[124],"time":[126],"f(k,epsilon)":[127],"*":[128],"poly(n).":[129],"3.":[130],"There":[131],"no":[133],"FPT-AS":[134],"unless":[135],"FPT=W[1].":[136],"For":[137],"corresponding":[139],"establish":[143],"vs.":[145],"W[1]-hardness":[146],"results.":[147]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}