{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:06:37Z","timestamp":1757617597469,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_45","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:00Z","timestamp":1741105980000},"page":"556-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for\u00a02-Balanced Connected k-Partition Problem in\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Jing","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junran","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"issue":"1","key":"45_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, P.M., Galbiati, G., Maffioli, F.: On the complexity of finding multi-constrained spanning trees. Discret. Appl. Math. 5(1), 39\u201350 (1983)","journal-title":"Discret. Appl. Math."},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Micha, E., Shah, N.: A little charity guarantees fair connected graph partitioning. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), pp. 4908\u20134916 (2022)","DOI":"10.1609\/aaai.v36i5.20420"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Gravin, N., Huang, X.: 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, pp. 527\u2013545, New York, NY, USA (2019). Association for Computing Machinery","DOI":"10.1145\/3328526.3329574"},{"issue":"1","key":"45_CR5","first-page":"177","volume":"9","author":"F Chataigner","year":"2007","unstructured":"Chataigner, F., Salgado, L., Wakabayashi, Y.: Approximation and inapproximability results on balanced connected partitions of graphs. Discrete Math. Theor. Comput. Sci. 9(1), 177\u2013192 (2007)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"45_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.-Z., et al.: Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3), 1753\u20131773 (2022)","journal-title":"J. Comb. Optim."},{"issue":"12","key":"45_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.-Z., Lin, G., Yao, X., Zhang, A.: Approximation algorithms for maximally balanced connected graph partition. Algorithmica 83(12), 3715\u20133740 (2021)","journal-title":"Algorithmica"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Kavitha, T., Mehlhorn, K., Sgouritsa, A.: A little charity guarantees almost envy-freeness. SIAM J. Comput. 50(4), 1336\u20131358 (2021)","DOI":"10.1137\/20M1359134"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Chu, A.-C., Wu, B.Y., Wang, H.-L., Chao, K.-M.: A tight bound on the min ratio edge-partitioning problem of a tree. Discrete Appl. Math. 158(14), 1471\u20131478 (2010)","DOI":"10.1016\/j.dam.2010.05.014"},{"issue":"2","key":"45_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"ME Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. 10(2), 139\u2013153 (1985)","journal-title":"Discret. Appl. Math."},{"key":"45_CR11","unstructured":"Gy\u00f6ri, E.: On division of graphs to connected subgraphs. In: Combinatorics, pp. 485\u2013494, Keszthely (1978)"},{"issue":"5","key":"45_CR12","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.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60(5), 225\u2013230 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"45_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz, L.: A homology theory for spanning trees of a graph. Acta Math. Hungar. 30(3), 241\u2013251 (1977)","journal-title":"Acta Math. Hungar."},{"issue":"2","key":"45_CR14","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.: Most uniform path partitioning and its use in image processing. Discret. Appl. Math. 42(2), 227\u2013256 (1993)","journal-title":"Discret. Appl. Math."},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Mati\u0107, D., Grbi\u0107, M.: Partitioning weighted metabolic networks into maximally balanced connected partitions. In: 2020 19th International Symposium INFOTEH-JAHORINA (INFOTEH), pp. 1\u20136 (2020)","DOI":"10.1109\/INFOTEH48170.2020.9066293"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Wu, J.-J., Liu, P., Chung, Y.-C.: Metadata partitioning for large-scale distributed storage systems. In: Proceedings of the 3rd IEEE International Conference on Cloud Computing, pp. 212\u2013219 (2010)","DOI":"10.1109\/CLOUD.2010.24"},{"key":"45_CR17","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.: 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 (2019)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:54:53Z","timestamp":1757141693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}