{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:44:38Z","timestamp":1775947478764,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015269","name":"Innov\u00e1ci\u00f3s \u00e9s Technol\u00f3giai Miniszt\u00e9rium","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100015269","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115881","type":"journal-article","created":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T00:23:44Z","timestamp":1773361424000},"page":"115881","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximating submodular matroid-constrained partitioning"],"prefix":"10.1016","volume":"1073","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0457-4573","authenticated-orcid":false,"given":"Krist\u00f3f","family":"B\u00e9rczi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7218-2112","authenticated-orcid":false,"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7263-1614","authenticated-orcid":false,"given":"Daniel P.","family":"Szabo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3421-7238","authenticated-orcid":false,"given":"Karthekeyan","family":"Chandrasekaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.tcs.2026.115881_bib0001","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","article-title":"The complexity of multiterminal cuts","volume":"23","author":"Dahlhaus","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115881_bib0002","series-title":"Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing","first-page":"724","article-title":"Multiway cut, pairwise realizable distributions, and descending thresholds","author":"Sharma","year":"2014"},{"issue":"1","key":"10.1016\/j.tcs.2026.115881_bib0003","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S0097539792251730","article-title":"Finding k cuts within twice the optimal","volume":"24","author":"Saran","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.115881_bib0004","doi-asserted-by":"crossref","first-page":"10","DOI":"10.3390\/a11010010","article-title":"Inapproximability of maximum biclique problems, minimum k-cut and densest at-least-k-subgraph from the small set expansion hypothesis","volume":"11","author":"Manurangsi","year":"2018","journal-title":"Algorithms"},{"issue":"1","key":"10.1016\/j.tcs.2026.115881_bib0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/toc.2020.v016a014","article-title":"On the hardness of approximating the k-way hypergraph cut problem","volume":"16","author":"Chekuri","year":"2020","journal-title":"Theory Comput."},{"key":"10.1016\/j.tcs.2026.115881_bib0006","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10107-004-0510-2","article-title":"Greedy splitting algorithms for approximating multiway partition problems","volume":"102","author":"Zhao","year":"2005","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.tcs.2026.115881_bib0007","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s00453-010-9483-0","article-title":"Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems","volume":"62","author":"Okumoto","year":"2012","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115881_bib0008","doi-asserted-by":"crossref","first-page":"3198","DOI":"10.1137\/24M1638604","article-title":"Approximating submodular k-partition via principal partition sequence","volume":"38","author":"Chandrasekaran","year":"2024","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2026.115881_bib0009","series-title":"Combinatorial Algorithms: 32nd International Workshop (IWOCA)","first-page":"516","article-title":"New approximations and hardness results for submodular partitioning problems","author":"Santiago","year":"2021"},{"key":"10.1016\/j.tcs.2026.115881_bib0010","series-title":"2011 IEEE 52nd Annual Symposium on Foundations of Computer Science","first-page":"807","article-title":"Approximation algorithms for submodular multiway partition","author":"Chekuri","year":"2011"},{"key":"10.1016\/j.tcs.2026.115881_bib0011","series-title":"Integer Programming and Combinatorial Optimization","first-page":"72","article-title":"Monotone submodular multiway partition","author":"Bi","year":"2025"},{"key":"10.1016\/j.tcs.2026.115881_bib0012","series-title":"49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)","first-page":"25:1","article-title":"Multiway cuts with a choice of representatives","author":"B\u00e9rczi","year":"2024"},{"issue":"1","key":"10.1016\/j.tcs.2026.115881_bib0013","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/S0895480104445095","article-title":"The Steiner k-cut problem","volume":"20","author":"Chekuri","year":"2006","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2026.115881_bib0014","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10878-005-1412-9","article-title":"The polymatroid Steiner problems","volume":"9","author":"Calinescu","year":"2005","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.115881_bib0015","series-title":"Integer Programming and Combinatorial Optimization","first-page":"132","article-title":"On minimum 3-cuts and approximating k-cuts using cut trees","author":"Kapoor","year":"1996"},{"key":"10.1016\/j.tcs.2026.115881_bib0016","series-title":"Matroid Theory","author":"Oxley","year":"2011"},{"key":"10.1016\/j.tcs.2026.115881_bib0017","doi-asserted-by":"crossref","first-page":"97","DOI":"10.4153\/CJM-1959-013-8","article-title":"Lattice theory of generalized partitions","volume":"11","author":"Hartmanis","year":"1959","journal-title":"Can. J. Math."},{"key":"10.1016\/j.tcs.2026.115881_bib0018","article-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/j.tcs.2026.115881_bib0019","series-title":"Combinatorial Optimization: Polyhedra and Efficiency","volume":"24","author":"Schrijver","year":"2003"},{"issue":"4","key":"10.1016\/j.tcs.2026.115881_bib0020","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF01192523","article-title":"Minimizing submodular functions over families of sets","volume":"15","author":"Goemans","year":"1995","journal-title":"Combinatorica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001404?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001404?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:03:01Z","timestamp":1775944981000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":20,"alternative-id":["S0304397526001404"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115881","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximating submodular matroid-constrained partitioning","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115881","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115881"}}