{"id":"https://openalex.org/W2808830316","doi":"https://doi.org/10.1145/3210377.3210398","title":"Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection","display_name":"Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2808830316","doi":"https://doi.org/10.1145/3210377.3210398","mag":"2808830316"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210398","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5016682913","display_name":"Harald R\u00e4cke","orcid":"https://orcid.org/0000-0001-8797-717X"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Harald R\u00e4cke","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Roy Schwartz","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054087189","display_name":"Richard Stotz","orcid":"https://orcid.org/0009-0003-2663-9371"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Richard Stotz","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016682913"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09970161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9897000193595886,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9876999855041504,"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.9264992475509644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6940019726753235},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.6681175231933594},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6579080820083618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6239234805107117},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.540250301361084},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.472469300031662},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4639643430709839},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44712573289871216},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4321939945220947},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3111516833305359}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9264992475509644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6940019726753235},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.6681175231933594},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6579080820083618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6239234805107117},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.540250301361084},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.472469300031662},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4639643430709839},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44712573289871216},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4321939945220947},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3111516833305359},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210398","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4938645737","display_name":null,"funder_award_id":"1336/16","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W110441439","https://openalex.org/W295352820","https://openalex.org/W1595948819","https://openalex.org/W2005887911","https://openalex.org/W2017280430","https://openalex.org/W2020066367","https://openalex.org/W2020632401","https://openalex.org/W2052936935","https://openalex.org/W2065309575","https://openalex.org/W2076164610","https://openalex.org/W2088844265","https://openalex.org/W2113513143","https://openalex.org/W2132592548","https://openalex.org/W2145818650","https://openalex.org/W2150148016","https://openalex.org/W2151679746","https://openalex.org/W2169528477","https://openalex.org/W2272158670","https://openalex.org/W2293508337","https://openalex.org/W2403101477","https://openalex.org/W2552383377","https://openalex.org/W2559041228","https://openalex.org/W4291028494"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W1537073411","https://openalex.org/W3138003926","https://openalex.org/W1630514295","https://openalex.org/W2952498147","https://openalex.org/W2227884660","https://openalex.org/W2558716804","https://openalex.org/W2120970098","https://openalex.org/W2537901922","https://openalex.org/W2952933284"],"abstract_inverted_index":{"In":[0,47,164],"the":[1,6,24,40,82,95,136,144,150,189,208,224,235,251],"Minimum":[2,42,56,72,109,166,175,214,256,260],"Hypergraph":[3,167,257],"Bisection":[4,43,57,73,110,168,176,215,258],"problem,":[5],"vertex":[7,201],"set":[8],"of":[9,19,26,39,191,210,237,255],"a":[10,36,52,126,181],"hypergraph":[11,199],"has":[12],"to":[13,79,172,234],"be":[14,77],"partitioned":[15],"into":[16],"two":[17],"parts":[18,30],"equal":[20],"size":[21],"so":[22],"that":[23,66,91,108,135,194,220,243],"number":[25],"hyperedges":[27],"intersecting":[28],"both":[29],"is":[31,35,64,93,130,138,162,169,222],"minimized.":[32],"This":[33],"problem":[34,44,137,190],"natural":[37],"generalization":[38],"well-studied":[41],"in":[45,58,74,86,111,177,216],"graphs.":[46,61],"this":[48,87,92,221,244],"paper":[49,88],"we":[50,89,106,133,218],"present":[51],"sharp":[53],"distinction":[54],"between":[55],"hypergraphs":[59,80],"and":[60,200,231,259],"Whereas":[62],"it":[63],"well-known":[65],"all":[67],"bi-criteria":[68],"approximation":[69,103,118,128,156,183,253],"algorithms":[70,184,212],"for":[71,179,198,213,226],"graphs":[75],"can":[76],"extended":[78],"with":[81],"exact":[83],"same":[84],"guarantees,":[85],"prove":[90,219],"not":[94,223],"case":[96,225],"when":[97],"considering":[98],"true":[99],"(i.e.,":[100],"non":[101],"bi-criteria)":[102],"algorithms.":[104],"Specifically,":[105],"show":[107,134,242],"Hypergraphs":[112],"admits":[113],"an":[114],"$\\tilde\\mathcalO":[115],"(\\sqrtn":[116],")$":[117,161],"algorithm":[119],"(and":[120],"highlight":[121],"several":[122],"special":[123],"cases":[124],"where":[125],"better":[127,158],"ratio":[129,157,254],"possible).":[131],"Additionally,":[132],"at":[139,207],"least":[140],"as":[141,143],"hard":[142],"Densest":[145],"k":[146],"-Subgraph":[147],"problem.":[148],"Assuming":[149],"Dense":[151],"vs.":[152],"Random":[153],"Conjecture~\\citeCDK12,":[154],"no":[155],"than":[159,174],"$\\bigO(n^1/4-\\varepsilon":[160],"possible.":[163],"particular,":[165],"much":[170],"harder":[171],"approximate":[173],"graphs,":[178,217],"which":[180],"logarithmic":[182],"exist~\\citeRae08.":[185],"We":[186,228],"also":[187],"consider":[188],"constructing":[192],"trees":[193,205],"are":[195],"cut":[196,246],"sparsifiers":[197],"cuts.":[202],"While":[203],"similar":[204],"lie":[206],"heart":[209],"powerful":[211],"hypergraphs.":[227],"give":[229],"upper":[230],"lower":[232],"bounds":[233,241],"quality":[236],"such":[238],"trees.":[239],"Our":[240],"tree":[245],"sparsifying":[247],"approach":[248],"cannot":[249],"improve":[250],"general":[252],"Vertex":[261],"Bisection.":[262]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}