{"id":"https://openalex.org/W1983022219","doi":"https://doi.org/10.1145/1721837.1721845","title":"Approximating fractional hypertree width","display_name":"Approximating fractional hypertree width","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W1983022219","doi":"https://doi.org/10.1145/1721837.1721845","mag":"1983022219"},"language":"en","primary_location":{"id":"doi:10.1145/1721837.1721845","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721845","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/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Budapest University of Technology and Economics, Budapest, Hungary","Budapest University of Technology and Economics , Budapest , Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Budapest University of Technology and Economics , Budapest , Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":6.7656,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.97082922,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"2","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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.9919999837875366,"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.9900000095367432,"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.9804577827453613},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8243565559387207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6865280866622925},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6486485004425049},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5172253847122192},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5038575530052185},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4787575304508209},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.46714091300964355},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.45273062586784363},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41307225823402405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40071776509284973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21271172165870667},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.15753602981567383},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15658417344093323},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.11195528507232666},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.055080026388168335},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.05504468083381653}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9804577827453613},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8243565559387207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6865280866622925},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6486485004425049},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5172253847122192},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5038575530052185},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4787575304508209},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.46714091300964355},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.45273062586784363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41307225823402405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40071776509284973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21271172165870667},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.15753602981567383},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15658417344093323},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.11195528507232666},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.055080026388168335},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.05504468083381653},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"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/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1721837.1721845","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721845","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/G4547255915","display_name":null,"funder_award_id":"OTKA 67651","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W99828349","https://openalex.org/W144954708","https://openalex.org/W1485335602","https://openalex.org/W1560870503","https://openalex.org/W1571197496","https://openalex.org/W1967265779","https://openalex.org/W1991410678","https://openalex.org/W1993704152","https://openalex.org/W1994520092","https://openalex.org/W2003995429","https://openalex.org/W2008536061","https://openalex.org/W2026745535","https://openalex.org/W2027519504","https://openalex.org/W2027562075","https://openalex.org/W2033325972","https://openalex.org/W2049197377","https://openalex.org/W2057256946","https://openalex.org/W2059372025","https://openalex.org/W2063951771","https://openalex.org/W2065023965","https://openalex.org/W2075508548","https://openalex.org/W2111829945","https://openalex.org/W2116407296","https://openalex.org/W2118348286","https://openalex.org/W2119213574","https://openalex.org/W2129023820","https://openalex.org/W2134850460","https://openalex.org/W2143474538","https://openalex.org/W2150339067","https://openalex.org/W2157827214","https://openalex.org/W2166566648","https://openalex.org/W2175676614","https://openalex.org/W2611804663","https://openalex.org/W3022173737","https://openalex.org/W3121437753","https://openalex.org/W3140964092","https://openalex.org/W4254380579","https://openalex.org/W4285719527","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W2933667225","https://openalex.org/W2008536061","https://openalex.org/W2280659633","https://openalex.org/W2032444001","https://openalex.org/W2401514316","https://openalex.org/W2950294966","https://openalex.org/W1988026822","https://openalex.org/W4292713356","https://openalex.org/W2400665160","https://openalex.org/W2533772561"],"abstract_inverted_index":{"Fractional":[0],"hypertree":[1,12,47,79,88,109,144,164],"width":[2,10,80,91,165],"is":[3,68,136,154,157],"a":[4,44,69,74,86,117,137,147],"hypergraph":[5,51,75,170],"measure":[6],"similar":[7],"to":[8,114,150],"tree":[9],"and":[11,31,178],"width.":[13],"Its":[14],"algorithmic":[15],"importance":[16],"comes":[17],"from":[18],"the":[19,41,50,53,121,166],"fact":[20],"that,":[21,72],"as":[22],"shown":[23],"in":[24,34,120,130,155],"previous":[25],"work,":[26],"Constraint":[27],"Satisfaction":[28],"Problems":[29],"(CSP)":[30],"various":[32],"problems":[33],"database":[35],"theory":[36],"are":[37],"polynomial-time":[38,70,103,158,182],"solvable":[39],"if":[40,134],"input":[42],"contains":[43],"bounded-width":[45,107],"fractional":[46,78,87,108,143,163],"decomposition":[48,89,118,126],"of":[49,52,90,139],"constraints.":[54],"In":[55],"this":[56],"article,":[57],"we":[58],"show":[59],"that":[60,102,172],"for":[61,97],"every":[62],"fixed":[63],"w":[64,83,94],"\u2265":[65],"1,":[66],"there":[67],"algorithm":[71],"given":[73,116],"H":[76,98,135,156],"with":[77,141],"at":[81],"most":[82,167],",":[84],"computes":[85],"O":[92],"(":[93],"3":[95],")":[96],".":[99],"This":[100,160],"means":[101],"algorithms":[104],"relying":[105],"on":[106],"decompositions":[110],"no":[111],"longer":[112],"need":[113],"be":[115,128],"explicitly":[119],"input,":[122],"since":[123],"an":[124],"appropriate":[125],"can":[127],"computed":[129],"polynomial":[131],"time.":[132],"Therefore,":[133],"class":[138],"hypergraphs":[140],"bounded":[142,162],"width,":[145],"then":[146],"CSP":[148],"restricted":[149],"instances":[151],"whose":[152],"structure":[153],"solvable.":[159,183],"makes":[161,173],"general":[168],"known":[169],"property":[171],"CSP,":[174],"Boolean":[175],"conjunctive":[176,179],"queries,":[177],"query":[180],"containment":[181]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}