{"id":"https://openalex.org/W4362678598","doi":"https://doi.org/10.1145/3558481.3591087","title":"Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications","display_name":"Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4362678598","doi":"https://doi.org/10.1145/3558481.3591087"},"language":"en","primary_location":{"id":"doi:10.1145/3558481.3591087","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","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/A5051660284","display_name":"P\u00e1l Andr\u00e1s Papp","orcid":"https://orcid.org/0009-0005-6667-802X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P\u00e1l Andr\u00e1s Papp","raw_affiliation_strings":["Huawei Zurich Research Center, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0005-6667-802X","affiliations":[{"raw_affiliation_string":"Huawei Zurich Research Center, Zurich, Switzerland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031484321","display_name":"Georg Anegg","orcid":"https://orcid.org/0000-0002-5730-5812"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Georg Anegg","raw_affiliation_strings":["Huawei Zurich Research Center, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-5730-5812","affiliations":[{"raw_affiliation_string":"Huawei Zurich Research Center, Zurich, Switzerland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012014394","display_name":"Albert-Jan N. Yzelman","orcid":"https://orcid.org/0000-0001-8842-3689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Albert-Jan N. Yzelman","raw_affiliation_strings":["Huawei Zurich Research Center, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0001-8842-3689","affiliations":[{"raw_affiliation_string":"Huawei Zurich Research Center, Zurich, Switzerland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6136,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66159609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"415","last_page":"425"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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.9987000226974487,"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/hypergraph","display_name":"Hypergraph","score":0.8845196962356567},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8047885894775391},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6584372520446777},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6462223529815674},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5587921142578125},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5483425855636597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5117716193199158},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.459231972694397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4337380826473236},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.429644376039505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3287596106529236},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25992435216903687}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8845196962356567},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8047885894775391},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6584372520446777},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6462223529815674},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5587921142578125},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5483425855636597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5117716193199158},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.459231972694397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4337380826473236},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.429644376039505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3287596106529236},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25992435216903687}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3558481.3591087","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1150057154","https://openalex.org/W1490530634","https://openalex.org/W1972913305","https://openalex.org/W1996256520","https://openalex.org/W2005751233","https://openalex.org/W2018342998","https://openalex.org/W2022490362","https://openalex.org/W2042088790","https://openalex.org/W2065309575","https://openalex.org/W2065698702","https://openalex.org/W2067945058","https://openalex.org/W2069985946","https://openalex.org/W2078174680","https://openalex.org/W2088844265","https://openalex.org/W2115234124","https://openalex.org/W2122466336","https://openalex.org/W2127101191","https://openalex.org/W2127391575","https://openalex.org/W2150148016","https://openalex.org/W2169528477","https://openalex.org/W2490706771","https://openalex.org/W2552383377","https://openalex.org/W2892262517","https://openalex.org/W2950509221","https://openalex.org/W2963489471","https://openalex.org/W3005070048","https://openalex.org/W3024254707","https://openalex.org/W3094438149","https://openalex.org/W3112296152","https://openalex.org/W3128792128","https://openalex.org/W4235156957","https://openalex.org/W4249939137"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W154868527","https://openalex.org/W1630514295","https://openalex.org/W1034070228","https://openalex.org/W2552825874","https://openalex.org/W2070751425","https://openalex.org/W2963158951"],"abstract_inverted_index":{"We":[0,71,109],"study":[1,111],"the":[2,30,49,52,56,65,90,97,112,115,125],"balanced":[3],"k-way":[4],"hypergraph":[5,21],"partitioning":[6,116],"problem,":[7],"with":[8],"a":[9,20,81,119],"special":[10],"focus":[11],"on":[12,22],"its":[13],"practical":[14],"applications":[15],"to":[16,28,79],"manycore":[17],"scheduling.":[18],"Given":[19],"n":[23,43,87],"nodes,":[24],"our":[25],"goal":[26],"is":[27],"partition":[29],"node":[31],"set":[32],"into":[33],"k":[34,45],"parts":[35],"of":[36,51,58,67,89,105,114],"size":[37],"at":[38],"most":[39],"(1":[40],"+":[41],"\u2208)\u00b7":[42],"over":[44],"each,":[46],"while":[47],"minimizing":[48],"cost":[50],"partitioning,":[53],"defined":[54],"as":[55],"number":[57,66],"cut":[59],"hyperedges,":[60],"possibly":[61],"also":[62,110],"weighted":[63],"by":[64],"partitions":[68],"they":[69],"intersect.":[70],"show":[72],"that":[73],"this":[74],"problem":[75,117],"cannot":[76],"be":[77],"approximated":[78],"within":[80],"n1":[82],"/":[83],"poly":[84],"log":[85,86],"factor":[88],"optimal":[91],"solution":[92],"in":[93,124],"polynomial":[94],"time":[95],"if":[96],"Exponential":[98],"Time":[99],"Hypothesis":[100],"holds,":[101],"even":[102],"for":[103],"hypergraphs":[104],"maximal":[106],"degree":[107],"2.":[108],"hardness":[113],"from":[118],"parameterized":[120],"complexity":[121],"perspective,":[122],"and":[123],"more":[126],"general":[127],"case":[128],"when":[129],"we":[130],"have":[131],"multiple":[132],"balance":[133],"constraints.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2023-04-07T00:00:00"}