{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:32Z","timestamp":1781345672277,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583539","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"694-704","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Cut-matching Games for Generalized Hypergraph Ratio Cuts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0117-3304","authenticated-orcid":false,"given":"Nate","family":"Veldt","sequence":"first","affiliation":[{"name":"Texas A&M University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network flows","author":"Ahuja K","unstructured":"Ravindra\u00a0K Ahuja, Thomas\u00a0L Magnanti, and James\u00a0B Orlin. 1988. Network flows. Prentice-Hall Inc."},{"key":"e_1_3_2_1_2_1","volume-title":"Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. arXiv preprint arXiv:2301.08920","author":"Ameranis Konstantinos","year":"2023","unstructured":"Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, and Erasmo Tani. 2023. Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. arXiv preprint arXiv:2301.08920 (2023)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 2008 Annual ACM-SIAM Symposium on Discrete Algorithms(SODA \u201908)","author":"Andersen Reid","year":"2008","unstructured":"Reid Andersen and Kevin\u00a0J. Lang. 2008. An Algorithm for Improving Graph Partitions. In Proceedings of the 2008 Annual ACM-SIAM Symposium on Discrete Algorithms(SODA \u201908). Society for Industrial and Applied Mathematics, 651\u2013660."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_6_1","volume-title":"Higher-order organization of complex networks. Science 353, 6295","author":"Benson R.","year":"2016","unstructured":"Austin\u00a0R. Benson, David\u00a0F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science 353, 6295 (2016), 163\u2013166."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178123"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_9_1","volume-title":"On implementing the push-relabel method for the maximum flow problem. Algorithmica 19, 4","author":"Cherkassky V","year":"1997","unstructured":"Boris\u00a0V Cherkassky and Andrew\u00a0V Goldberg. 1997. On implementing the push-relabel method for the maximum flow problem. Algorithmica 19, 4 (1997)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abh1303"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/cbms"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424305"},{"key":"e_1_3_2_1_13_1","unstructured":"Kimon Fountoulakis Pan Li and Shenghao Yang. 2021. Local hyper-flow diffusion. In Advances in Neural Information Processing Systems(NeurIPS \u201921 Vol.\u00a034)."},{"key":"e_1_3_2_1_14_1","series-title":"SIAM Review (to appear)","volume-title":"Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance","author":"Fountoulakis K.","year":"2023","unstructured":"K. Fountoulakis, M. Liu, D.\u00a0F. Gleich, and M.\u00a0W. Mahoney. 2023. Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance. SIAM Review (to appear) (2023)."},{"key":"e_1_3_2_1_15_1","volume-title":"CVX: Matlab Software for Disciplined Convex Programming, version 2.1","author":"Grant Michael","year":"2014","unstructured":"Michael Grant and Stephen Boyd. 2014. CVX: Matlab Software for Disciplined Convex Programming, version 2.1. http:\/\/cvxr.com\/cvx."},{"key":"e_1_3_2_1_16_1","unstructured":"Matthias Hein Simon Setzer Leonardo Jost and Syama\u00a0Sundar Rangapuram. 2013. The total variation on hypergraphs-learning on hypergraphs revisited. In Advances in Neural Information Processing Systems(NeurIPS \u201913 Vol.\u00a026)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0243485"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90115-P"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451058"},{"key":"e_1_3_2_1_20_1","volume-title":"Towards Tight Bounds for Spectral Sparsification of Hypergraphs. arXiv preprint arXiv:2011.06530","author":"Kapralov Michael","year":"2020","unstructured":"Michael Kapralov, Robert Krauthgamer, Jakab Tardos, and Yuichi Yoshida. 2020. Towards Tight Bounds for Spectral Sparsification of Hypergraphs. arXiv preprint arXiv:2011.06530 (2020)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538903"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623706"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-008-0202-0"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_25_1","first-page":"1","article-title":"Quadratic Decomposable Submodular Function Minimization: Theory and Practice","volume":"21","author":"Li Pan","year":"2020","unstructured":"Pan Li, Niao He, and Olgica Milenkovic. 2020. Quadratic Decomposable Submodular Function Minimization: Theory and Practice. Journal of Machine Learning Research 21, 106 (2020), 1\u201349. http:\/\/jmlr.org\/papers\/v21\/18-790.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_26_1","unstructured":"Pan Li and Olgica Milenkovic. 2017. Inhomogeneous Hypergraph Clustering with Applications. In Advances in Neural Information Processing Systems 30(NeurIPS \u201917). 2308\u20132318."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning(ICML \u201918)","author":"Li Pan","year":"2018","unstructured":"Pan Li and Olgica Milenkovic. 2018. Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering. In Proceedings of the 35th International Conference on Machine Learning(ICML \u201918). 3014\u20133023."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449887"},{"key":"e_1_3_2_1_29_1","volume-title":"Cut-matching games on directed graphs. arXiv preprint arXiv:1010.1047","author":"Louis Anand","year":"2010","unstructured":"Anand Louis. 2010. Cut-matching games on directed graphs. arXiv preprint arXiv:1010.1047 (2010)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746555"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2016.v012a017"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503318"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1018"},{"key":"e_1_3_2_1_34_1","volume-title":"Fast approximation algorithms for graph partitioning using spectral and semidefinite-programming techniques. Ph.\u00a0D. Dissertation","author":"Orecchia Lorenzo","unstructured":"Lorenzo Orecchia. 2011. Fast approximation algorithms for graph partitioning using spectral and semidefinite-programming techniques. Ph.\u00a0D. Dissertation. University of California, Berkeley."},{"key":"e_1_3_2_1_35_1","volume-title":"Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. In International Conference on Machine Learning(ICML \u201922)","author":"Orecchia Lorenzo","year":"2022","unstructured":"Lorenzo Orecchia, Konstantinos Ameranis, Charalampos Tsourakakis, and Kunal Talwar. 2022. Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. In International Conference on Machine Learning(ICML \u201922). 17071\u201317093."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374442"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634168"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.66"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403248"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451108"},{"key":"e_1_3_2_1_42_1","volume-title":"Cut-matching Games for Generalized Hypergraph Ratio Cuts. arXiv preprint arXiv:2301.12274","author":"Veldt Nate","year":"2023","unstructured":"Nate Veldt. 2023. Cut-matching Games for Generalized Hypergraph Ratio Cuts. arXiv preprint arXiv:2301.12274 (2023)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403222"},{"key":"e_1_3_2_1_44_1","unstructured":"Nate Veldt Austin\u00a0R Benson and Jon Kleinberg. 2021. Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. In Advances in Neural Information Processing Systems(NeurIPS \u201921 Vol.\u00a034)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1321048"},{"key":"e_1_3_2_1_46_1","volume-title":"Combinatorial characterizations and impossibilities for higher-order homophily. Science Advances 9, 1","author":"Veldt Nate","year":"2023","unstructured":"Nate Veldt, Austin\u00a0R Benson, and Jon Kleinberg. 2023. Combinatorial characterizations and impossibilities for higher-order homophily. Science Advances 9, 1 (2023), eabq3200."},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of The 33rd International Conference on Machine Learning(ICML \u201916)","author":"Veldt Nate","year":"2016","unstructured":"Nate Veldt, David Gleich, and Michael Mahoney. 2016. A Simple and Strongly-Local Flow-Based Method for Cut Improvement. In Proceedings of The 33rd International Conference on Machine Learning(ICML \u201916). 1938\u20131947."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975673.43"},{"key":"e_1_3_2_1_49_1","volume-title":"Network flow algorithms","author":"Williamson P","unstructured":"David\u00a0P Williamson. 2019. Network flow algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.160"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2006. Learning with Hypergraphs: Clustering Classification and Embedding. In Advances in Neural Information Processing Systems(NeurIPS \u201906). 1601\u20131608.","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-022-00483-x"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583539","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:03Z","timestamp":1750178823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":53,"alternative-id":["10.1145\/3543507.3583539","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583539","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}