{"id":"https://openalex.org/W1973538949","doi":"https://doi.org/10.1137/080743226","title":"Approximating Width Parameters of Hypergraphs with Excluded Minors","display_name":"Approximating Width Parameters of Hypergraphs with Excluded Minors","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1973538949","doi":"https://doi.org/10.1137/080743226","mag":"1973538949"},"language":"en","primary_location":{"id":"doi:10.1137/080743226","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080743226","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3214,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5793993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":"3","first_page":"1331","last_page":"1348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9373226165771484},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9019902944564819},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8845566511154175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7527999877929688},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6538272500038147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5217621922492981},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4671128988265991},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41808682680130005},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3937007188796997},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15457403659820557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13153129816055298},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10458087921142578}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9373226165771484},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9019902944564819},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8845566511154175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7527999877929688},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6538272500038147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5217621922492981},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4671128988265991},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41808682680130005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3937007188796997},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15457403659820557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13153129816055298},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10458087921142578},{"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/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080743226","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080743226","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.8274","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.8274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/%7Efomin/articles/2011/2011m.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W1560870503","https://openalex.org/W1983022219","https://openalex.org/W1983798870","https://openalex.org/W2004485491","https://openalex.org/W2008536061","https://openalex.org/W2012687409","https://openalex.org/W2026745535","https://openalex.org/W2028348726","https://openalex.org/W2029448190","https://openalex.org/W2031042330","https://openalex.org/W2033325972","https://openalex.org/W2033843939","https://openalex.org/W2034674470","https://openalex.org/W2035409201","https://openalex.org/W2057256946","https://openalex.org/W2065023965","https://openalex.org/W2076164610","https://openalex.org/W2085348754","https://openalex.org/W2087083200","https://openalex.org/W2106518318","https://openalex.org/W2119213574","https://openalex.org/W2124442576","https://openalex.org/W2130481157","https://openalex.org/W2134483537","https://openalex.org/W2158584754","https://openalex.org/W2335288698","https://openalex.org/W2628596753","https://openalex.org/W4254380579"],"related_works":["https://openalex.org/W2933667225","https://openalex.org/W2008536061","https://openalex.org/W2280659633","https://openalex.org/W1979091081","https://openalex.org/W2091522522","https://openalex.org/W2628596753","https://openalex.org/W2949978915","https://openalex.org/W2134402143","https://openalex.org/W4302801230","https://openalex.org/W2480025839"],"abstract_inverted_index":{"The":[0],"notions":[1,26],"of":[2,22,40,55,71,76,82,87,103,113,129,138,151,178,181],"hypertree":[3,7,38,74,101,154,186,218],"width":[4,8,39,45,75,102,155,187,219],"and":[5,14,32,61,136,184],"generalized":[6,29],"were":[9,27],"introduced":[10,35],"by":[11,30,110],"Gottlob,":[12],"Leone,":[13],"Scarcello":[15],"in":[16,58,147],"order":[17],"to":[18,95,122,226],"extend":[19],"the":[20,36,53,69,80,85,98,111,118,143,149],"concept":[21],"hypergraph":[23,105,169],"acyclicity.":[24],"These":[25],"further":[28],"Grohe":[31],"Marx,":[33],"who":[34],"fractional":[37],"a":[41,104,168,197,208],"hypergraph.":[42],"All":[43],"these":[44],"parameters":[46,188],"on":[47,220],"hypergraphs":[48,78,179,221],"are":[49,193],"useful":[50],"for":[51,173,215],"extending":[52],"tractability":[54],"many":[56],"problems":[57],"database":[59],"theory":[60],"artificial":[62],"intelligence.":[63],"In":[64,204],"this":[65],"paper,":[66],"we":[67,206],"study":[68],"approximability":[70],"(generalized,":[72,99,152,216],"fractional)":[73,100,153,217],"sparse":[77,176,194],"where":[79,196],"criterion":[81],"sparsity":[83,86],"reflects":[84],"their":[88],"incidence":[89,115,119,182,223],"graphs.":[90],"Our":[91],"first":[92],"step":[93],"is":[94,106,202],"prove":[96],"that":[97,163],"constant":[107,198,209],"factor":[108,199,210],"sandwiched":[109],"treewidth":[112,180],"its":[114,165],"graph":[116,120,125,131,229],"when":[117],"belongs":[121],"some":[123,227],"apex-minor-free":[124,130],"class":[126],"(the":[127],"family":[128],"classes":[132],"includes":[133],"planar":[134],"graphs":[135,137,183,224],"bounded":[139],"genus).":[140],"This":[141],"determines":[142],"combinatorial":[144],"borderline":[145],"above":[146],"which":[148],"notion":[150],"becomes":[156],"essentially":[157],"more":[158,174],"general":[159,175],"than":[160],"treewidth,":[161],"justifying":[162],"way":[164],"functionality":[166],"as":[167],"acyclicity":[170],"measure.":[171],"While":[172],"families":[177,195],"all":[185],"may":[189],"differ":[190],"arbitrarily,":[191],"there":[192],"approximation":[200,211],"algorithm":[201,214],"possible.":[203],"particular,":[205],"give":[207],"polynomial":[212],"time":[213],"whose":[222],"belong":[225],"-minor-free":[228],"class.":[230]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}