{"id":"https://openalex.org/W2624220145","doi":"https://doi.org/10.1145/2636918","title":"Constraint Solving via Fractional Edge Covers","display_name":"Constraint Solving via Fractional Edge Covers","publication_year":2014,"publication_date":"2014-08-25","ids":{"openalex":"https://openalex.org/W2624220145","doi":"https://doi.org/10.1145/2636918","mag":"2624220145"},"language":"en","primary_location":{"id":"doi:10.1145/2636918","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636918","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["RWTH Aachen University, Lehrstuhl f\u00fcr Informatik 7, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Lehrstuhl f\u00fcr Informatik 7, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.1473,"has_fulltext":false,"cited_by_count":118,"citation_normalized_percentile":{"value":0.97524549,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9897000193595886,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.9162509441375732},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6988043785095215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6448227167129517},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6143142580986023},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6104056239128113},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5804951190948486},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5526174902915955},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4704025387763977},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.45744723081588745},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4454635679721832},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3554530143737793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3453137278556824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22216340899467468},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.12912076711654663},{"id":"https://openalex.org/keywords/hyperbolic-geometry","display_name":"Hyperbolic geometry","score":0.07594999670982361},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06874147057533264}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9162509441375732},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6988043785095215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6448227167129517},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6143142580986023},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6104056239128113},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5804951190948486},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5526174902915955},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4704025387763977},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.45744723081588745},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4454635679721832},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3554530143737793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3453137278556824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22216340899467468},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.12912076711654663},{"id":"https://openalex.org/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"score":0.07594999670982361},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06874147057533264},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"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/C192939610","wikidata":"https://www.wikidata.org/wiki/Q188444","display_name":"Differential geometry","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2636918","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636918","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7324173974","display_name":null,"funder_award_id":"NK105645","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W99828349","https://openalex.org/W132145278","https://openalex.org/W1530753374","https://openalex.org/W1560870503","https://openalex.org/W1972100851","https://openalex.org/W1973538949","https://openalex.org/W1983022219","https://openalex.org/W1995725694","https://openalex.org/W1997649256","https://openalex.org/W1999038767","https://openalex.org/W2008536061","https://openalex.org/W2011911122","https://openalex.org/W2019404372","https://openalex.org/W2026745535","https://openalex.org/W2027519504","https://openalex.org/W2030893020","https://openalex.org/W2032487621","https://openalex.org/W2033325972","https://openalex.org/W2034674470","https://openalex.org/W2041961594","https://openalex.org/W2045985005","https://openalex.org/W2049197377","https://openalex.org/W2057256946","https://openalex.org/W2065023965","https://openalex.org/W2066776015","https://openalex.org/W2067706177","https://openalex.org/W2104498537","https://openalex.org/W2111829945","https://openalex.org/W2116407296","https://openalex.org/W2143238590","https://openalex.org/W2150339067","https://openalex.org/W2153629319","https://openalex.org/W2157827214","https://openalex.org/W2166566648","https://openalex.org/W2169998163","https://openalex.org/W2296148711","https://openalex.org/W2337098149","https://openalex.org/W2561675875","https://openalex.org/W2628596753","https://openalex.org/W2790840297","https://openalex.org/W2914039150","https://openalex.org/W2951209234","https://openalex.org/W2952861917","https://openalex.org/W2988480584","https://openalex.org/W4285719527","https://openalex.org/W4387761158"],"related_works":["https://openalex.org/W5383638","https://openalex.org/W2134402143","https://openalex.org/W2362150722","https://openalex.org/W4313304827","https://openalex.org/W4386827690","https://openalex.org/W2397006633","https://openalex.org/W2023722467","https://openalex.org/W2129131081","https://openalex.org/W1774334694","https://openalex.org/W3101089670"],"abstract_inverted_index":{"Many":[0],"important":[1],"combinatorial":[2],"problems":[3,19,107],"can":[4,36,113],"be":[5,51,114],"modeled":[6],"as":[7],"constraint":[8,17,105],"satisfaction":[9,18,106],"problems.":[10],"Hence,":[11],"identifying":[12],"polynomial-time":[13,52,75,158],"solvable":[14,53,76],"classes":[15],"of":[16,24,57,74,98],"has":[20],"received":[21],"a":[22,71,131],"lot":[23],"attention.":[25],"In":[26],"this":[27],"article,":[28],"we":[29,69,93],"are":[30],"interested":[31],"in":[32,116,126],"structural":[33,45,154],"properties":[34],"that":[35,47,104,120,143,156],"make":[37],"the":[38,43,55,96,121,127,150],"problem":[39],"tractable.":[40],"So":[41],"far,":[42],"largest":[44],"class":[46,56,73],"is":[48,54,124,148],"known":[49,153],"to":[50],"bounded":[58,80,109,144],"hypertree":[59,86,100,111,146],"width":[60,87,112,147],"instances":[61],"introduced":[62],"by":[63],"Gottlob":[64],"et":[65],"al.":[66],"[2002].":[67],"Here":[68],"identify":[70],"new":[72],"instances:":[77],"those":[78],"having":[79],"fractional":[81,89,99,110,145],"edge":[82,90],"cover":[83,91],"number.":[84],"Combining":[85],"and":[88],"number,":[92],"then":[94],"introduce":[95],"notion":[97],"width.":[101],"We":[102],"prove":[103],"with":[108,130],"solved":[115],"polynomial":[117],"time":[118],"(provided":[119],"tree":[122],"decomposition":[123],"given":[125],"input).":[128],"Together":[129],"recent":[132],"approximation":[133],"algorithm":[134],"for":[135],"finding":[136],"such":[137],"decompositions":[138],"[Marx":[139],"2010],":[140],"it":[141],"follows":[142],"now":[149],"most":[151],"generally":[152],"property":[155],"guarantees":[157],"solvability.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}