{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:45:28Z","timestamp":1772552728534,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"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":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1811461"],"award-info":[{"award-number":["U1811461"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515010900"],"award-info":[{"award-number":["2022A1515010900"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171168"],"award-info":[{"award-number":["12171168"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2020A1515010489"],"award-info":[{"award-number":["2020A1515010489"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Province Higher Education Foundation","award":["2021ZDZX1071"],"award-info":[{"award-number":["2021ZDZX1071"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12131004"],"award-info":[{"award-number":["12131004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["06446"],"award-info":[{"award-number":["06446"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871280"],"award-info":[{"award-number":["11871280"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-022-01183-7","type":"journal-article","created":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T23:33:08Z","timestamp":1655249588000},"page":"917-937","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis"],"prefix":"10.1007","volume":"87","author":[{"given":"Jian","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zan-Bo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deren","family":"Han","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-2224-1484","authenticated-orcid":false,"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"1183_CR1","doi-asserted-by":"crossref","unstructured":"Ageev, A.-A., Sviridenko, M.-I.: Approximation algorithms for maximum coverage and Max-Cut with given sizes of parts. In: Proceedings of the 7th Integer Programming and Combinatorial Optimization, pp. 17\u201330 (1999)","DOI":"10.1007\/3-540-48777-8_2"},{"key":"1183_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, G.: An approximation algorithm for max $$p$$-section. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, vol. 1563, pp. 237\u2013247 (1999)","DOI":"10.1007\/3-540-49116-3_22"},{"issue":"6","key":"1183_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0020-0190(98)00021-0","volume":"65","author":"G Andersson","year":"1998","unstructured":"Andersson, G., Engebretsen, L.: Better approximation algorithms for set splitting and NOT-ALL-EQUAL SAT. Inf. Process. Lett. 65(6), 305\u2013311 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1183_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2907052","volume":"13","author":"P Austrin","year":"2016","unstructured":"Austrin, P., Benabbas, S., Georgiou, K.: Better balance by being biased: a 0.8776-approximation for max bisection. ACM Trans. Algorithms 13(1), 1\u201327 (2016)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"1183_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493\u2013513 (1988)","journal-title":"Oper. Res."},{"issue":"1","key":"1183_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.11.003","volume":"60","author":"U Feige","year":"2006","unstructured":"Feige, U., Langberg, M.: The RPR$$^{2}$$ rounding technique for semidefinite programs. J. Algorithms 60(1), 1\u201323 (2006)","journal-title":"J. Algorithms"},{"issue":"1","key":"1183_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A-M Frieze","year":"1997","unstructured":"Frieze, A.-M., Jerrum, M.: Improved approximation algorithms for max $$k$$-cut and max bisection. Algorithmica 18(1), 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"1183_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2007.05.036","volume":"385","author":"G Galbiati","year":"2007","unstructured":"Galbiati, G., Maffioli, F.: Approximation algorithms for maximum cut with limited unbalance. Theoret. Comput. Sci. 385(1\u20133), 78\u201387 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"1183_CR9","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M-X Goemans","year":"1995","unstructured":"Goemans, M.-X., Williamson, D.-P.: Improved approximation algorithms for maximum Cut and satisfiability problem using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"1183_CR10","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.jcss.2003.07.012","volume":"68","author":"M-X Goemans","year":"2004","unstructured":"Goemans, M.-X., Williamson, D.-P.: Approximation algorithms for max-3-cut and other problems via complex semidefinite programming. J. Comput. Syst. Sci. 68(2), 442\u2013470 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1183_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/rsa.10035","volume":"20","author":"E Halperin","year":"2002","unstructured":"Halperin, E., Zwick, U.: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Struct. Algorithms 20(3), 382\u2013402 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"1183_CR12","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Kempe, D., Pal, M., Svitkina, Z.: Unbalance graph cuts. In: Proceedings of the 13th Annual European Symposium, pp. 191\u2013202 (2005)","DOI":"10.1007\/11561071_19"},{"issue":"10","key":"1183_CR13","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1007\/s11425-010-3087-7","volume":"53","author":"Y Huang","year":"2010","unstructured":"Huang, Y., Zhang, S.: Approximation algorithms for indefinite complex quadratic maximization problems. Sci. China Math. 53(10), 2697\u20132708 (2010)","journal-title":"Sci. China Math."},{"issue":"1","key":"1183_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results formax-cut and other 2-variable CSPs? SIAM J. Comput. 37(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1183_CR15","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1137\/17M115075X","volume":"29","author":"C Lu","year":"2019","unstructured":"Lu, C., Liu, Y.-F., Zhang, W.-Q., Zhang, S.-Z.: Tightness of a new and enhanced semidefinite relaxation for MIMO detection. SIAM J. Optim. 29(1), 719\u2013742 (2019)","journal-title":"SIAM J. Optim."},{"key":"1183_CR16","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Tan, N.: Approximating CSPs with global cardinality constraints using SDP hierarchies. In: Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms, pp. 373\u2013387 (2012)","DOI":"10.1137\/1.9781611973099.33"},{"issue":"3","key":"1183_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"issue":"4","key":"1183_CR18","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s11425-012-4512-x","volume":"56","author":"Y Xia","year":"2013","unstructured":"Xia, Y.: New semidefinite programming relaxations for box constrained quadratic program. Sci. China Math. 56(4), 877\u2013886 (2013)","journal-title":"Sci. China Math."},{"issue":"12","key":"1183_CR19","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1007\/s11425-014-4900-5","volume":"57","author":"B Xu","year":"2014","unstructured":"Xu, B., Yu, X., Zhang, X., Zhang, Z.: An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance. Sci. China Math. 57(12), 2437\u20132462 (2014)","journal-title":"Sci. China Math."},{"issue":"3","key":"1183_CR20","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1137\/130909597","volume":"24","author":"Z Xu","year":"2014","unstructured":"Xu, Z., Hong, M., Luo, Z.-Q.: Semidefinite approximation for mixed binary quadratically constrained quadratic programs. SIAM J. Optim. 24(3), 1265\u20131293 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1183_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/PL00011415","volume":"90","author":"Y Ye","year":"2001","unstructured":"Ye, Y.: A. 699-approximation algorithm for max-bisection. Math. Program. 90(1), 101\u2013111 (2001)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1183_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.dam.2002.07.001","volume":"142","author":"J Zhang","year":"2004","unstructured":"Zhang, J., Ye, Y., Han, Q.: Improved approximations for max set splitting and max NAE SAT. Discrete Appl. Math. 142(1\u20133), 133\u2013149 (2004)","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01183-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01183-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01183-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T19:54:42Z","timestamp":1698782082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01183-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":22,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1183"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01183-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,15]]},"assertion":[{"value":"31 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}