{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:58:11Z","timestamp":1781305091514,"version":"3.54.1"},"publisher-location":"Cham","reference-count":41,"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_21","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:20Z","timestamp":1781303720000},"page":"315-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\{s,t\\}$$-Separating Principal Partition Sequence of Submodular Functions"],"prefix":"10.1007","author":[{"given":"Krist\u00f3f","family":"B\u00e9rczi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karthekeyan","family":"Chandrasekaran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel P.","family":"Szabo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0167-6377(99)00071-1","volume":"26","author":"F Barahona","year":"2000","unstructured":"Barahona, F.: On the $$k$$-cut problem. Oper. Res. Lett. 26(3), 99\u2013105 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10107-018-1270-8","volume":"177","author":"K B\u00e9rczi","year":"2019","unstructured":"B\u00e9rczi, K., Chandrasekaran, K., Kir\u00e1ly, T., Lee, E., Xu, C.: Beating the 2-approximation factor for global bicut. Math. Program. 177(1), 291\u2013320 (2019)","journal-title":"Math. Program."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e9rczi, K., Chandrasekaran, K., Kir\u00e1ly, T., Szabo, D.P.: Approximating submodular matroid-constrained partitioning. arXiv preprint arXiv:2506.19507 (2025)","DOI":"10.2139\/ssrn.5605564"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0024-3795(71)90026-7","volume":"4","author":"J Bruno","year":"1971","unstructured":"Bruno, J., Weinberg, L.: The principal minors of a matroid. Linear Algebra Appl. 4(1), 17\u201354 (1971)","journal-title":"Linear Algebra Appl."},{"key":"21_CR5","unstructured":"B\u00e9rczi, K., Chandrasekaran, K., Kir\u00e1ly, T., Szabo, D.P.: $$\\{s, t\\}$$-separating principal partition sequence of submodular functions (2026). https:\/\/arxiv.org\/abs\/2510.25664"},{"key":"21_CR6","unstructured":"Chandrasekaran, K., Chekuri, C., Kulkarni, S.: On deleting vertices to reduce density in graphs and supermodular functions. In: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), pp. 43:1\u201343:20 (2025)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"3198","DOI":"10.1137\/24M1638604","volume":"38","author":"K Chandrasekaran","year":"2024","unstructured":"Chandrasekaran, K., Wang, W.: Approximating submodular $$ k $$-partition via principal partition sequence. SIAM J. Discret. Math. 38, 3198\u20133219 (2024)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1137\/19M1299359","volume":"34","author":"C Chekuri","year":"2020","unstructured":"Chekuri, C., Quanrud, K., Xu, C.: LP relaxation and tree packing for minimum $$k$$-Cut. SIAM J. Discret. Math. 34(2), 1334\u20131353 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Li, S.: On the hardness of approximating the $$k$$-way hypergraph cut problem. Theory Comput. 16(1) (2020)","DOI":"10.4086\/toc.2020.v016a014"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"WH Cunningham","year":"1985","unstructured":"Cunningham, W.H.: Optimal attack and reinforcement of a network. J. ACM (JACM) 32(3), 549\u2013561 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-218X(02)00457-2","volume":"131","author":"MP Desai","year":"2003","unstructured":"Desai, M.P., Narayanan, H., Patkar, S.B.: The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. Discret. Appl. Math. 131(2), 299\u2013310 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"21_CR12","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":"21_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1287\/moor.5.2.186","volume":"5","author":"S Fujishige","year":"1980","unstructured":"Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5(2), 186\u2013196 (1980)","journal-title":"Math. Oper. Res."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0166-218X(80)90057-8","volume":"2","author":"S Fujishige","year":"1980","unstructured":"Fujishige, S.: Principal structures of submodular systems. Discret. Appl. Math. 2, 77\u201379 (1980)","journal-title":"Discret. Appl. Math."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Fujishige, S.: Theory of principal partitions revisited. In: Research Trends in Combinatorial Optimization, pp. 127\u2013162. Springer (2009)","DOI":"10.1007\/978-3-540-76796-1_7"},{"issue":"1","key":"21_CR16","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."},{"key":"21_CR17","unstructured":"Harb, E., Quanrud, K., Chekuri, C.: Faster and scalable algorithms for densest subgraph and decomposition. Adv. Neural Inf. Process. Syst. (2022)"},{"key":"21_CR18","first-page":"180","volume":"51","author":"M Iri","year":"1968","unstructured":"Iri, M.: A min-max theorem for the ranks and term-ranks of a class of matrices: an algebraic approach to the problem of the topological degrees of freedom of a network. Trans. Inst. Electron. Commun. Eng. Japan 51, 180\u2013187 (1968)","journal-title":"Trans. Inst. Electron. Commun. Eng. Japan"},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/0024-3795(69)90015-9","volume":"2","author":"M Iri","year":"1969","unstructured":"Iri, M.: The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix. Linear Algebra Appl. 2(4), 427\u2013446 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1111\/j.1749-6632.1979.tb32805.x","volume":"319","author":"M Iri","year":"1979","unstructured":"Iri, M.: A review of recent work in Japan on principal partitions of matroids and their applications. Ann. N. Y. Acad. Sci. 319(1), 306\u2013319 (1979)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Iri, M.: Structural theory for the combinatorial systems characterized by submodular functions. In: Progress in Combinatorial Optimization, pp. 197\u2013219. Academic Press, New York (1984)","DOI":"10.1016\/B978-0-12-566780-7.50018-0"},{"key":"21_CR22","unstructured":"Kir\u00e1ly, T.: Computing the minimum cut in hypergraphic matroids. Tech. rep., Technical Report QP-2009-05, Egerv\u00e1ry Research Group, Budapest 2009 (2009). www.cs.elte.hu\/egres"},{"issue":"3","key":"21_CR23","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCT.1969.1082966","volume":"16","author":"G Kishi","year":"1969","unstructured":"Kishi, G., Kajitani, Y.: Maximally distant trees and principal partition of a linear graph. IEEE Trans. Circuit Theory 16(3), 323\u2013330 (1969)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"4","key":"21_CR24","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s00453-008-9177-z","volume":"56","author":"V Kolmogorov","year":"2010","unstructured":"Kolmogorov, V.: A faster algorithm for computing the principal sequence of partitions of a graph. Algorithmica 56(4), 394\u2013412 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"21_CR25","doi-asserted-by":"publisher","first-page":"10","DOI":"10.3390\/a11010010","volume":"11","author":"P Manurangsi","year":"2018","unstructured":"Manurangsi, P.: Inapproximability of maximum biclique problems, minimum $$k$$-cut and densest at-least-$$k$$-subgraph from the small set expansion hypothesis. Algorithms 11(1), 10 (2018)","journal-title":"Algorithms"},{"issue":"2","key":"21_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ipl.2006.11.011","volume":"102","author":"H Nagamochi","year":"2007","unstructured":"Nagamochi, H., Kamidoi, Y.: Minimum cost subpartitions in graphs. Inf. Process. Lett. 102(2), 79\u201384 (2007)","journal-title":"Inf. Process. Lett."},{"key":"21_CR27","unstructured":"Nagano, K., Kawahara, Y., Iwata, S.: Minimum average cost clustering. Adv. Neural. Inf. Process. Syst. 23 (2010)"},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01864166","volume":"4","author":"M Nakamura","year":"1988","unstructured":"Nakamura, M.: Structural theorems for submodular functions, polymatroids and polymatroid intersections. Graphs Combin. 4(1), 257\u2013284 (1988)","journal-title":"Graphs Combin."},{"key":"21_CR29","unstructured":"Narayanan, H.: Theory of matroids and network analysis. Ph.D. Thesis, Department of Electrical Engineering, Indian Institute of Technology (1974)"},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0024-3795(91)90070-D","volume":"144","author":"H Narayanan","year":"1991","unstructured":"Narayanan, H.: The principal lattice of partitions of a submodular function. Linear Algebra Appl. 144, 179\u2013216 (1991)","journal-title":"Linear Algebra Appl."},{"key":"21_CR31","volume-title":"Submodular functions and electrical networks, Annals of Discrete Mathematics","author":"H Narayanan","year":"1997","unstructured":"Narayanan, H.: Submodular functions and electrical networks, Annals of Discrete Mathematics, vol. 54. North-Holland Publishing Co., Amsterdam (1997)"},{"issue":"2","key":"21_CR32","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1996.0047","volume":"21","author":"H Narayanan","year":"1996","unstructured":"Narayanan, H., Roy, S., Patkar, S.: Approximation algorithms for min-$$k$$-overlap problems using the principal lattice of partitions approach. J. Algorithms 21(2), 306\u2013330 (1996)","journal-title":"J. Algorithms"},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"CSJ Nash-Williams","year":"1960","unstructured":"Nash-Williams, C.S.J.: On orientations, connectivity and odd-vertex-pairings in finite graphs. Can. J. Math. 12, 555\u2013567 (1960)","journal-title":"Can. J. Math."},{"issue":"3","key":"21_CR34","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00453-010-9483-0","volume":"62","author":"K Okumoto","year":"2012","unstructured":"Okumoto, K., Fukunaga, T., Nagamochi, H.: Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Algorithmica 62(3), 787\u2013806 (2012)","journal-title":"Algorithmica"},{"issue":"5","key":"21_CR35","first-page":"383","volume":"57","author":"T Ozawa","year":"1974","unstructured":"Ozawa, T.: Common trees and partition of two-graphs (in Japanese). Trans. Inst. Electron. Commun. Eng. Japan 57(5), 383\u2013390 (1974)","journal-title":"Trans. Inst. Electron. Commun. Eng. Japan"},{"key":"21_CR36","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0166-218X(02)00472-9","volume":"131","author":"SB Patkar","year":"2003","unstructured":"Patkar, S.B., Narayanan, H.: Improving graph partitions using submodular functions. Discret. Appl. Math. 131, 535\u2013553 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"21_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2007.01.040","volume":"186","author":"R Ravi","year":"2008","unstructured":"Ravi, R., Sinha, A.: Approximating $$k$$-cuts using network strength as a lagrangean relaxation. Eur. J. Oper. Res. 186(1), 77\u201390 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR38","doi-asserted-by":"crossref","unstructured":"Santiago, R.: New approximations and hardness results for submodular partitioning problems. In: Proceedings of International Workshop on Combinatorial Algorithms, pp. 516\u2013530. IWOCA (2021)","DOI":"10.1007\/978-3-030-79987-8_36"},{"issue":"1","key":"21_CR39","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S0097539792251730","volume":"24","author":"H Saran","year":"1995","unstructured":"Saran, H., Vazirani, V.: Finding $$k$$ cuts within twice the optimal. SIAM J. Comput. 24(1), 101\u2013108 (1995)","journal-title":"SIAM J. Comput."},{"key":"21_CR40","first-page":"83","volume":"59","author":"N Tomizawa","year":"1976","unstructured":"Tomizawa, N.: Strongly irreducible matroids and principal partition of a matroid into strongly irreducible minors (in Japanese). Trans. Inst. Electron. Commun. Eng. Japan 59, 83\u201391 (1976)","journal-title":"Trans. Inst. Electron. Commun. Eng. Japan"},{"key":"21_CR41","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-004-0510-2","volume":"102","author":"L Zhao","year":"2005","unstructured":"Zhao, L., Nagamochi, H., Ibaraki, T.: Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102, 167\u2013183 (2005)","journal-title":"Math. Program."}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:26Z","timestamp":1781303726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_21","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 declare no competing interests.","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"}}]}}