{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:55Z","timestamp":1740109315629,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation","award":["CCF-1907937"],"award-info":[{"award-number":["CCF-1907937"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1814613"],"award-info":[{"award-number":["CCF-1814613"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10107-021-01732-0","type":"journal-article","created":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T10:02:59Z","timestamp":1638180179000},"page":"27-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multicriteria cuts and size-constrained k-cuts in hypergraphs"],"prefix":"10.1007","volume":"197","author":[{"given":"Calvin","family":"Beideman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3421-7238","authenticated-orcid":false,"given":"Karthekeyan","family":"Chandrasekaran","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,29]]},"reference":[{"issue":"1\u20132","key":"1732_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0944-8","volume":"154","author":"H Aissi","year":"2015","unstructured":"Aissi, H., Mahjoub, A., McCormick, T., Queyranne, M.: Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154(1\u20132), 3\u201328 (2015)","journal-title":"Math. Program."},{"unstructured":"Aissi, H., Mahjoub, A., Ravi, R.: Randomized contractions for multiobjective minimum cuts. In: Proceedings of the 25th Annual European Symposium on Algorithms, ESA, pp. 6:1\u20136:13 (2017)","key":"1732_CR2"},{"issue":"1","key":"1732_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00453-006-0068-x","volume":"46","author":"A Armon","year":"2006","unstructured":"Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica 46(1), 15\u201326 (2006)","journal-title":"Algorithmica"},{"key":"1732_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-019-01443-7","volume":"186","author":"K Chandrasekaran","year":"2021","unstructured":"Chandrasekaran, K., Xu, C., Yu, X.: Hypergraph $$k$$-cut in randomized polynomial time. Math. Program. 186, 85\u2013113 (2021)","journal-title":"Math. Program."},{"issue":"6","key":"1732_CR5","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.1137\/18M1163865","volume":"47","author":"C Chekuri","year":"2018","unstructured":"Chekuri, C., Xu, C.: Minimum cuts and sparsification in hypergraphs. SIAM J. Comput. 47(6), 2118\u20132156 (2018)","journal-title":"SIAM J. Comput."},{"unstructured":"Dinits, E., Karzanov, A., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. In: Studies in Discrete Optimizatoin (in Russian), pp. 290\u2013306 (1976)","key":"1732_CR6"},{"doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Karger, D., Panigrahi, D.: Random contractions and sampling for hypergraph and hedge connectivity. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1101\u20131114 (2017)","key":"1732_CR7","DOI":"10.1137\/1.9781611974782.71"},{"issue":"2","key":"1732_CR8","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/120891502","volume":"27","author":"M Goemans","year":"2013","unstructured":"Goemans, M., Soto, J.: Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations. SIAM J. Discrete Math. 27(2), 1123\u20131145 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"1732_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Hochbaum, D.: A polynomial algorithm for the $$k$$-cut problem for fixed $$k$$. Math. Oper. Res. 19(1), 24\u201337 (1994)","journal-title":"Math. Oper. Res."},{"unstructured":"Guinez, F., Queyranne, M.: The size-constrained submodular k-partition problem. Unpublished manuscript. https:\/\/docs.google.com\/viewer?a=v&pid=sites&&srcid=ZGVmYXVsdGRvbWFpbnxmbGF2aW9ndWluZXpob21lcGFnZXxneDo0NDVlMThkMDg4ZWRlOGI1. See also https:\/\/smartech.gatech.edu\/bitstream\/handle\/1853\/43309\/Queyranne.pdf (2012)","key":"1732_CR10"},{"unstructured":"Karger, D.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 21\u201330 (1993)","key":"1732_CR11"},{"doi-asserted-by":"crossref","unstructured":"Karger, D.: Enumerating parametric global minimum cuts by random interleaving. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, STOC, pp. 542\u2013555 (2016)","key":"1732_CR12","DOI":"10.1145\/2897518.2897578"},{"doi-asserted-by":"crossref","unstructured":"Kogan, D., Krauthgamer, R.: Sketching cuts in graphs and hypergraphs. In: Proceedings of the 6th Conference on Innovations in Theoretical Computer Science, ITCS, pp. 367\u2013376 (2015)","key":"1732_CR13","DOI":"10.1145\/2688073.2688093"},{"issue":"2","key":"1732_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum number of facets of a convex polytope. Mathematika 17(2), 179\u2013184 (1970)","journal-title":"Mathematika"},{"issue":"4","key":"1732_CR15","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1137\/S0097539794282930","volume":"28","author":"K Mulmuley","year":"1999","unstructured":"Mulmuley, K.: Lower bounds in a parallel model without bit operations. SIAM J. Comput. 28(4), 1460\u20131509 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01732-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01732-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01732-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T01:05:39Z","timestamp":1674349539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01732-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,29]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1732"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01732-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,11,29]]},"assertion":[{"value":"19 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}