{"id":"https://openalex.org/W4367047292","doi":"https://doi.org/10.1145/3543507.3583539","title":"Cut-matching Games for Generalized Hypergraph Ratio Cuts","display_name":"Cut-matching Games for Generalized Hypergraph Ratio Cuts","publication_year":2023,"publication_date":"2023-04-26","ids":{"openalex":"https://openalex.org/W4367047292","doi":"https://doi.org/10.1145/3543507.3583539"},"language":"en","primary_location":{"id":"doi:10.1145/3543507.3583539","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3543507.3583539","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3543507.3583539","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Web Conference 2023","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3543507.3583539","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046315164","display_name":"Nate Veldt","orcid":"https://orcid.org/0000-0002-0117-3304"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nate Veldt","raw_affiliation_strings":["Texas A&M University, USA"],"raw_orcid":"https://orcid.org/0000-0002-0117-3304","affiliations":[{"raw_affiliation_string":"Texas A&M University, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046315164"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.5578,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6928122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"694","last_page":"704"},"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.9972000122070312,"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.9972000122070312,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.9645162224769592},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.712505578994751},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6065921783447266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4817824065685272},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.472432941198349},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4495276212692261},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4309832751750946},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4299715757369995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4055977165699005},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3961995840072632},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3635685443878174},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3426823914051056},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12797623872756958}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9645162224769592},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.712505578994751},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6065921783447266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4817824065685272},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.472432941198349},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4495276212692261},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4309832751750946},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4299715757369995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4055977165699005},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3961995840072632},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3635685443878174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3426823914051056},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12797623872756958},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":1,"locations":[{"id":"doi:10.1145/3543507.3583539","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3543507.3583539","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3543507.3583539","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Web Conference 2023","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3543507.3583539","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3543507.3583539","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3543507.3583539","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Web Conference 2023","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.44999998807907104,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4367047292.pdf"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W1973113780","https://openalex.org/W1984361668","https://openalex.org/W2016273060","https://openalex.org/W2018804864","https://openalex.org/W2078013954","https://openalex.org/W2086254934","https://openalex.org/W2088844265","https://openalex.org/W2116877738","https://openalex.org/W2134062801","https://openalex.org/W2148025043","https://openalex.org/W2150148016","https://openalex.org/W2162148078","https://openalex.org/W2170057991","https://openalex.org/W2560674852","https://openalex.org/W2608702473","https://openalex.org/W2743418339","https://openalex.org/W2753289174","https://openalex.org/W2920238557","https://openalex.org/W2962780495","https://openalex.org/W2963055664","https://openalex.org/W2971196067","https://openalex.org/W2982394413","https://openalex.org/W2999163148","https://openalex.org/W3010316612","https://openalex.org/W3035518758","https://openalex.org/W3039339554","https://openalex.org/W3080389405","https://openalex.org/W3081374773","https://openalex.org/W3101676988","https://openalex.org/W3118621910","https://openalex.org/W3152772521","https://openalex.org/W3167705025","https://openalex.org/W3169940233","https://openalex.org/W3177994886","https://openalex.org/W4205264571","https://openalex.org/W4211250771","https://openalex.org/W4221151135","https://openalex.org/W4313203312"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W1537073411","https://openalex.org/W1948107826","https://openalex.org/W3138003926","https://openalex.org/W1630514295","https://openalex.org/W4300037846","https://openalex.org/W4288275998","https://openalex.org/W2963081352","https://openalex.org/W4376608938","https://openalex.org/W2472555608"],"abstract_inverted_index":{"Many":[0],"social":[1],"networks":[2],"and":[3,24,88],"web-based":[4,124],"datasets":[5],"are":[6],"characterized":[7],"by":[8],"multiway":[9],"interactions":[10],"(e.g.,":[11],"groups":[12],"of":[13,35,47,73,139],"co-purchased":[14],"online":[15],"retail":[16],"products":[17],"or":[18],"group":[19],"conversations":[20],"in":[21,75,97],"Q&A":[22],"forums)":[23],"hypergraph":[25,48,57,108],"clustering":[26],"is":[27,103],"a":[28,44,62,98,115,136],"fundamental":[29],"primitive":[30],"for":[31,43,84],"analyzing":[32],"these":[33],"types":[34],"interactions.":[36],"We":[37],"present":[38],"an":[39],"O(log":[40],"n)-approximation":[41],"algorithm":[42],"broad":[45],"class":[46],"ratio":[49,86,109,132],"cut":[50,58,66,110,133],"objectives.":[51],"This":[52],"includes":[53],"objectives":[54],"involving":[55],"generalized":[56],"functions,":[59],"which":[60],"allow":[61],"user":[63],"to":[64],"penalize":[65],"hyperedges":[67],"differently":[68],"depending":[69],"on":[70,91,122],"the":[71,81],"number":[72],"nodes":[74],"each":[76],"cluster.":[77],"Our":[78],"method":[79],"generalizes":[80],"cut-matching":[82],"framework":[83],"graph":[85],"cuts,":[87],"relies":[89],"only":[90],"solving":[92,114],"maximum":[93],"s-t":[94],"flow":[95],"problems":[96],"special":[99],"reduced":[100],"graph.":[101],"It":[102],"significantly":[104],"faster":[105],"than":[106],"existing":[107],"algorithms,":[111],"while":[112],"also":[113],"more":[116],"general":[117],"problem.":[118],"In":[119],"numerical":[120],"experiments":[121],"various":[123],"hypergraphs,":[125],"we":[126],"show":[127],"that":[128],"it":[129],"quickly":[130],"finds":[131],"solutions":[134],"within":[135],"small":[137],"factor":[138],"optimality.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2025-10-10T00:00:00"}