{"id":"https://openalex.org/W4411403508","doi":"https://doi.org/10.1145/3725296","title":"Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized","display_name":"Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized","publication_year":2025,"publication_date":"2025-06-17","ids":{"openalex":"https://openalex.org/W4411403508","doi":"https://doi.org/10.1145/3725296"},"language":"en","primary_location":{"id":"doi:10.1145/3725296","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725296","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3725296","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072972143","display_name":"Vaishali Surianarayanan","orcid":"https://orcid.org/0000-0003-3091-3823"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vaishali Surianarayanan","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, USA"],"raw_orcid":"https://orcid.org/0000-0003-3091-3823","affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5118331007","display_name":"Anikait Mundhra","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anikait Mundhra","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, USA"],"raw_orcid":"https://orcid.org/0009-0009-3512-5181","affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5118331008","display_name":"E S Ajaykrishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ajaykrishnan E S","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, USA"],"raw_orcid":"https://orcid.org/0009-0001-4080-3647","affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, USA"],"raw_orcid":"https://orcid.org/0000-0002-3166-9212","affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13204319,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"3","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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.9983000159263611,"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/T11106","display_name":"Data Management and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9460595846176147},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6636717319488525},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5977743864059448},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5481302738189697},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.48257604241371155},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46701034903526306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45609888434410095},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4458961486816406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4446040987968445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4208931624889374},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41564637422561646},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3421698212623596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3357001841068268},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20958024263381958},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07512640953063965}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9460595846176147},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6636717319488525},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5977743864059448},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5481302738189697},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.48257604241371155},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46701034903526306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45609888434410095},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4458961486816406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4446040987968445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4208931624889374},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41564637422561646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3421698212623596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3357001841068268},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20958024263381958},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07512640953063965},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3725296","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725296","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3725296","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725296","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1560870503","https://openalex.org/W1976151205","https://openalex.org/W1979091081","https://openalex.org/W1983022219","https://openalex.org/W1993667194","https://openalex.org/W2008536061","https://openalex.org/W2008865455","https://openalex.org/W2033325972","https://openalex.org/W2055633823","https://openalex.org/W2150148016","https://openalex.org/W2269919984","https://openalex.org/W2270993886","https://openalex.org/W2290724595","https://openalex.org/W2423871547","https://openalex.org/W2604241689","https://openalex.org/W2612777267","https://openalex.org/W2624220145","https://openalex.org/W2753377075","https://openalex.org/W2794645646","https://openalex.org/W2888273277","https://openalex.org/W2906408488","https://openalex.org/W2914414140","https://openalex.org/W2952585724","https://openalex.org/W2963066364","https://openalex.org/W2963068377","https://openalex.org/W2963560792","https://openalex.org/W2990166677","https://openalex.org/W2995165452","https://openalex.org/W3013303285","https://openalex.org/W3040087842","https://openalex.org/W3200757673","https://openalex.org/W4205585032","https://openalex.org/W4281718597","https://openalex.org/W4285136459","https://openalex.org/W4290989357","https://openalex.org/W4313250736","https://openalex.org/W4313479136","https://openalex.org/W4323343708","https://openalex.org/W4379135714","https://openalex.org/W4379800800","https://openalex.org/W4386827690","https://openalex.org/W4387294046","https://openalex.org/W4390450394","https://openalex.org/W4404849824","https://openalex.org/W6862360952"],"related_works":["https://openalex.org/W2933667225","https://openalex.org/W2280659633","https://openalex.org/W1979091081","https://openalex.org/W2091522522","https://openalex.org/W4302801230","https://openalex.org/W2008536061","https://openalex.org/W4308505582","https://openalex.org/W2959649007","https://openalex.org/W4288283333","https://openalex.org/W1524736198"],"abstract_inverted_index":{"Efficient":[0],"query":[1],"evaluation":[2,157],"in":[3,16],"databases":[4],"and":[5,33,66,90,183],"solving":[6],"constraint":[7],"satisfaction":[8],"problems":[9,28],"(CSPs)":[10],"are":[11,34],"crucial":[12],"for":[13,80,94,102,125,170,178,187],"improving":[14],"performance":[15],"many":[17],"real-world":[18],"applications,":[19],"from":[20,62],"large-scale":[21],"data":[22],"management":[23],"to":[24,85],"decision-making":[25],"systems.":[26],"These":[27],"naturally":[29],"admit":[30],"hypergraph":[31],"representations,":[32],"efficiently":[35],"solvable":[36],"using":[37,77],"hypertree":[38,92,128,171],"decomposition":[39,43],"techniques,":[40],"when":[41],"the":[42,64,108,119,145,159],"width":[44,88,185],"is":[45],"small.":[46],"However,":[47],"these":[48,103],"techniques":[49],"require":[50],"finding":[51],"small-width":[52],"decompositions":[53,93,177,186],"efficiently.":[54],"This":[55],"remains":[56],"a":[57,82,165],"significant":[58],"challenge":[59],"despite":[60],"research":[61],"both":[63],"database":[65],"theory":[67],"communities.":[68],"In":[69],"this":[70,133],"work":[71],"we":[72,147,173],"present":[73,148],"Ralph":[74],"(Randomized":[75],"Approximation":[76],"Linear":[78],"Programming":[79],"Hypertree-Decompositions),":[81],"fast":[83],"algorithm":[84,124],"compute":[86],"low":[87,184],"fractional":[89,126],"generalized":[91],"input":[95],"hypergraphs,":[96],"as":[97,99],"well":[98,166],"lower":[100],"bounds":[101],"widths.":[104],"We":[105],"build":[106],"on":[107,158],"recent":[109],"breakthrough":[110],"by":[111],"Korchemna":[112],"et":[113],"al.":[114],"[FOCS":[115],"2024],":[116],"which":[117],"introduced":[118],"first":[120],"polynomial":[121],"time":[122],"approximation":[123],"(generalized)":[127],"width.":[129],"Our":[130],"approach":[131],"combines":[132],"theoretical":[134,153],"advancement":[135],"with":[136,151],"practical":[137],"heuristic":[138],"improvements":[139],"utilizing":[140],"(mixed-integer)":[141],"linear":[142],"programs.":[143],"Along":[144],"way,":[146],"new":[149],"algorithms":[150],"strong":[152],"guarantees.":[154],"Through":[155],"empirical":[156],"nearly":[160],"3700":[161],"instances":[162,182],"of":[163],"HyperBench,":[164],"established":[167],"benchmark":[168],"suite":[169],"decompositions,":[172],"find":[174],"near":[175],"optimal":[176],"all":[179,188],"previously":[180,190],"solved":[181],"500":[189],"unsolved":[191],"instances,":[192],"effectively":[193],"pushing":[194],"state-of-the-art.":[195]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}