{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:21:12Z","timestamp":1757618472721,"version":"3.44.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271259","61872422"],"award-info":[{"award-number":["12271259","61872422"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10878-025-01332-0","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:34:23Z","timestamp":1751517263000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for 2-balanced connected k-partition problem in graphs"],"prefix":"10.1007","volume":"50","author":[{"given":"Junran","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaquan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3085-2701","authenticated-orcid":false,"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"key":"1332_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph Theory. Springer, New York"},{"issue":"1","key":"1332_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0166-218X(83)90014-8","volume":"5","author":"PM Camerini","year":"1983","unstructured":"Camerini PM, Galbiati G, Maffioli F (1983) On the complexity of finding multi-constrained spanning trees. Discret Appl Math 5(1):39\u201350","journal-title":"Discret Appl Math"},{"key":"1332_CR3","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Micha E, Shah N (2022) A little charity guarantees fair connected graph partitioning. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), pages 4908-4916,","DOI":"10.1609\/aaai.v36i5.20420"},{"key":"1332_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Gravin N, Huang X (2019) Envy-freeness up to any item with high Nash welfare: The virtue of donating items. In Proceedings of the 2019 ACM Conference on Economics and Computation, EC-19, page 527-545, New York, NY, USA. Association for Computing Machinery","DOI":"10.1145\/3328526.3329574"},{"issue":"1","key":"1332_CR5","first-page":"177","volume":"9","author":"F Chataigner","year":"2007","unstructured":"Chataigner F, Salgado L, Wakabayashi Y (2007) Approximation and inapproximability results on balanced connected partitions of graphs. Discrete Mathematics and Theoretical Computer Science 9(1):177\u2013192","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"3","key":"1332_CR6","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1007\/s10878-020-00544-w","volume":"44","author":"G Chen","year":"2022","unstructured":"Chen G, Chen Y, Chen Z et al (2022) Approximation algorithms for the maximally balanced connected graph tripartition problem. J Comb Optim 44(3):1753\u20131773","journal-title":"J Comb Optim"},{"issue":"12","key":"1332_CR7","doi-asserted-by":"publisher","first-page":"3715","DOI":"10.1007\/s00453-021-00870-3","volume":"83","author":"Y Chen","year":"2021","unstructured":"Chen Y, Chen Z, Lin G, Yao X, Zhang A (2021) Approximation algorithms for maximally balanced connected graph partition. Algorithmica 83(12):3715\u20133740","journal-title":"Algorithmica"},{"issue":"4","key":"1332_CR8","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/20M1359134","volume":"50","author":"BR Chaudhury","year":"2021","unstructured":"Chaudhury BR, Kavitha T, Mehlhorn K, Sgouritsa A (2021) A little charity guarantees almost envy-freeness. SIAM J Comput 50(4):1336\u20131358","journal-title":"SIAM J Comput"},{"issue":"14","key":"1332_CR9","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1016\/j.dam.2010.05.014","volume":"158","author":"A Chu","year":"2010","unstructured":"Chu A, Wu BY, Wang H, Chao K (2010) A tight bound on the min ratio edge-partitioning problem of a tree. Discret Appl Math 158(14):1471\u20131478","journal-title":"Discret Appl Math"},{"issue":"1","key":"1332_CR10","first-page":"177","volume":"9","author":"F Chataigner","year":"2007","unstructured":"Chataigner F, Salgado L, Wakabayashi Y (2007) Approximation and inapproximability results on balanced connected partitions of graphs. Discrete Mathematics and Theoretical Computer Science 9(1):177\u2013192","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"5","key":"1332_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0020-0190(96)00175-5","volume":"60","author":"J Chlebikova","year":"1996","unstructured":"Chlebikova J (1996) Approximating the maximally balanced connected partition problem in graphs. Inf Process Lett 60(5):225\u2013230","journal-title":"Inf Process Lett"},{"issue":"2","key":"1332_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"ME Dyer","year":"1985","unstructured":"Dyer ME, Frieze AM (1985) On the complexity of partitioning graphs into connected subgraphs. Discret Appl Math 10(2):139\u2013153","journal-title":"Discret Appl Math"},{"key":"1332_CR13","unstructured":"Gy\u00f6ri E (1978) On division of graphs to connected subgraphs. In Combinatorics, pages 485-494, Keszthely"},{"issue":"3","key":"1332_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz L (1977) A homology theory for spanning trees of a graph. Acta Math Hungar 30(3):241\u2013251","journal-title":"Acta Math Hungar"},{"issue":"2","key":"1332_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","volume":"42","author":"M Lucertini","year":"1993","unstructured":"Lucertini M, Perl Y, Simeone B (1993) Most uniform path partitioning and its use in image processing. Discret Appl Math 42(2):227\u2013256","journal-title":"Discret Appl Math"},{"key":"1332_CR16","doi-asserted-by":"crossref","unstructured":"Mati\u0107 D, Grbi\u0107 M (2020) Partitioning weighted metabolic networks into maximally balanced connected partitions. In 2020 19th International Symposium INFOTEH-JAHORINA (INFOTEH), pages 1-6","DOI":"10.1109\/INFOTEH48170.2020.9066293"},{"key":"1332_CR17","doi-asserted-by":"crossref","unstructured":"Wu J, Liu P, Chung Y (2010) Metadata partitioning for large-scale distributed storage systems. In Proceedings of the 3rd IEEE International Conference on Cloud Computing, pages 212-219","DOI":"10.1109\/CLOUD.2010.24"},{"key":"1332_CR18","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.eswa.2018.09.001","volume":"116","author":"X Zhou","year":"2019","unstructured":"Zhou X, Wang H, Ding B, Tianjiang H, Shang S (2019) Balanced connected task allocations for multi-robot systems: An exact flow-based integer program and an approximate treebased genetic algorithm. Expert Syst Appl 116:10\u201320","journal-title":"Expert Syst Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01332-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01332-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01332-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T00:48:07Z","timestamp":1757206087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01332-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1332"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01332-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,7,3]]},"assertion":[{"value":"14 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"4"}}