{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:37Z","timestamp":1781305057939,"version":"3.54.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_22","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:46Z","timestamp":1781303746000},"page":"331-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hedgegraph Polymatroids"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3421-7238","authenticated-orcid":false,"given":"Karthekeyan","family":"Chandrasekaran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3035-1699","authenticated-orcid":false,"given":"Chandra","family":"Chekuri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0628-5532","authenticated-orcid":false,"given":"Weihang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2809-3010","authenticated-orcid":false,"given":"Weihao","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Alrabiah, O., Guruswami, V., Li, R.: Randomly punctured Reed\u2013Solomon codes achieve list-decoding capacity over linear-sized fields. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 1458\u20131469 (2024)","DOI":"10.1145\/3618260.3649634"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Amburg, I., Veldt, N., Benson, A.: Clustering in graphs and hypergraphs with categorical edge labels. In: Proceedings of The Web Conference 2020, pp. 706\u2013717 (2020)","DOI":"10.1145\/3366423.3380152"},{"key":"22_CR3","unstructured":"B\u00e9rczi, K., Chandrasekaran, K., Kir\u00e1ly, T., Kulkarni, S.: Splitting-off in hypergraphs. In: International Colloquium on Automata, Languages and Programming (ICALP), pp. 23:1\u201323:20 (2024)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gionis, A., Gullo, F., Tsourakakis, C.E., Ukkonen, A.: Chromatic correlation clustering. ACM Trans. Knowl. Discov. Data 9(4) (2015)","DOI":"10.1145\/2728170"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1002\/rsa.20274","volume":"35","author":"G C\u0103linescu","year":"2009","unstructured":"C\u0103linescu, G., Chekuri, C., Vondr\u00e1k, J.: Disjoint bases in a polymatroid. Random Struct. Algorithms 35(4), 418\u2013430 (2009)","journal-title":"Random Struct. Algorithms"},{"key":"22_CR6","unstructured":"Chandrasekaran, K., Chekuri, C., Wang, W., Zhu, W.: Hedgegraph polymatroids. arXiv:2510.25043 (2025)"},{"key":"22_CR7","unstructured":"Chandrasekaran, K., Chekuri, C., Zhu, W.: Online disjoint spanning trees and polymatroid bases. In: 52nd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 44:1\u201344:20 (2025)"},{"key":"22_CR8","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":"02","key":"22_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1142\/S0129626407002958","volume":"17","author":"D Coudert","year":"2007","unstructured":"Coudert, D., Datta, P., Perennes, S., Rivano, H., Voge, M.-E.: Shared risk resource group complexity and approximability issues. Parallel Process. Lett. 17(02), 169\u2013184 (2007)","journal-title":"Parallel Process. Lett."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Coudert, D., Perennes, S., Rivano, H., Voge, M.-E.: Combinatorial optimization in networks with shared risk link groups. Discrete Math. Theor. Comput. Sci. 18(3) (2016)","DOI":"10.46298\/dmtcs.1297"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Minimum partition of a matroid into independent sets. J. Res. Natl. Bur. Stand. Sect. B 69B, 67\u201372 (1965)","DOI":"10.6028\/jres.069B.004"},{"key":"22_CR12","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. Comb. Struct. Appl., pp. 69\u201387 (1970)"},{"key":"22_CR13","unstructured":"Edmonds, J., Rota, G.-C.: Submodular set functions. In: Waterloo Combinatorics Conference. University of Waterloo Waterloo, Ontario (1966)"},{"issue":"8","key":"22_CR14","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.jcss.2010.02.012","volume":"76","author":"MR Fellows","year":"2010","unstructured":"Fellows, M.R., Guo, J., Kanj, I.: The parameterized complexity of some minimum label problems. J. Comput. Syst. Sci. 76(8), 727\u2013740 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Korhonen, T., Lokshtanov, D., Saurabh, S.: Fixed-parameter tractability of hedge cut. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1402\u20131411 (2025)","DOI":"10.1137\/1.9781611978322.43"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Fox, K., Panigrahi, D., Zhang, F.: Minimum cut and minimum $$k$$-cut in hypergraphs via branching contractions. ACM Trans. Algorithms 19(2) (2023)","DOI":"10.1145\/3570162"},{"key":"22_CR17","volume-title":"Connections in Combinatorial Optimization","author":"A Frank","year":"2011","unstructured":"Frank, A.: Connections in Combinatorial Optimization. Oxford University Press, Oxford (2011)"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0166-218X(02)00462-6","volume":"131","author":"A Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T., Kir\u00e1ly, Z.: On the orientation of graphs and hypergraphs. Discret. Appl. Math. 131(2), 385\u2013400 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0166-218X(02)00463-8","volume":"131","author":"A Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T., Kriesell, M.: On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131(2), 373\u2013383 (2003)","journal-title":"Discret. Appl. Math."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Karger, D., Panigrahi, D.: Random contractions and sampling for hypergraph and hedge connectivity. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1101\u20131114 (2017)","DOI":"10.1137\/1.9781611974782.71"},{"issue":"2","key":"22_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1137\/21M1463707","volume":"53","author":"Z Guo","year":"2024","unstructured":"Guo, Z., Li, R., Shangguan, C., Tamo, I., Wootters, M.: Improved list-decodability and list-recoverability of Reed\u2013Solomon codes via tree packings. SIAM J. Comput. 53(2), 389\u2013430 (2024)","journal-title":"SIAM J. Comput."},{"key":"22_CR22","unstructured":"Jaeger, F.: On nowhere-zero flows in multigraphs. In: Proceedings, Fifth British Combinatorial Conference, Aberdeen, pp. 373\u2013378 (1975)"},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0095-8956(79)90057-1","volume":"26","author":"F Jaeger","year":"1979","unstructured":"Jaeger, F.: Flows and generalized coloring theorems in graphs. J. Comb. Theory Ser. B 26(2), 205\u2013216 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Jaffke, L., Lima, P.T., Masa\u0159\u00edk, T., Pilipczuk, M., Souza, U.S.: A tight quasi-polynomial bound for global label min-cut. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 290\u2013303 (2023)","DOI":"10.1137\/1.9781611977554.ch12"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.24.2.383","volume":"24","author":"DR Karger","year":"1999","unstructured":"Karger, D.R.: Random sampling in cut, flow, and network design problems. Math. Oper. Res. 24(2), 383\u2013413 (1999)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"22_CR26","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0036144501387141","volume":"43","author":"DR Karger","year":"2001","unstructured":"Karger, D.R.: A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM Rev. 43(3), 499\u2013522 (2001)","journal-title":"SIAM Rev."},{"key":"22_CR27","first-page":"289","volume":"17","author":"M Lorea","year":"1978","unstructured":"Lorea, M.: Hypergraphes et matroides. Cahiers Centre Etudes Rech. Oper 17, 289\u2013291 (1978)","journal-title":"Cahiers Centre Etudes Rech. Oper"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"CSJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"CSJA Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of Finite graphs into forests. J. London Math. Soc. 39, 12 (1964)","journal-title":"J. London Math. Soc."},{"key":"22_CR30","unstructured":"Petruschka, A., Sapir, S., Tzalik, E.: Color Fault-Tolerant spanners. In: 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), pp. 88:1\u201388:17 (2024)"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Quanrud, K.: Quotient sparsification for submodular functions. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 5209\u20135248. SIAM (2024)","DOI":"10.1137\/1.9781611977912.187"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"WT Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into $$n$$ connected factors. J. London Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. London Math. Soc."},{"key":"22_CR33","unstructured":"West, D.: Introduction to Graph Theory, vol. 2. Prentice Hall (2001)"},{"issue":"2","key":"22_CR34","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s10878-009-9222-0","volume":"21","author":"P Zhang","year":"2011","unstructured":"Zhang, P., Cai, J.-Y., Tang, L.-Q., Zhao, W.-B.: Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21(2), 192\u2013208 (2011)","journal-title":"J. Comb. Optim."},{"key":"22_CR35","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2016.08.006","volume":"648","author":"P Zhang","year":"2016","unstructured":"Zhang, P., Fu, B.: The label cut problem with respect to path length and label frequency. Theoret. Comput. Sci. 648, 72\u201383 (2016)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:50Z","timestamp":1781303750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}