{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:53Z","timestamp":1759637633656},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_28","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"324-335","source":"Crossref","is-referenced-by-count":2,"title":["A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem"],"prefix":"10.1007","author":[{"given":"Chenchen","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-qing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-49116-3_22","volume-title":"STACS 99","author":"G. Andersson","year":"1999","unstructured":"Andersson, G.: An Approximation Algorithm for Max p-Section. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 237\u2013247. Springer, Heidelberg (1999)"},{"key":"28_CR2","first-page":"277","volume-title":"24th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"P. Austrin","year":"2013","unstructured":"Austrin, P., Benabbas, S., Georgiou, K.: Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection. In: 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 277\u2013294. SIAM Press, New Orleans (2013)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/02331934.2011.592527","volume":"61","author":"S. Choudhury","year":"2012","unstructured":"Choudhury, S., Gaur, D., Krishnamurti, R.: An Approximation Algorithm for Max k-Uncut with Capacity Constraints. Optim.\u00a061, 143\u2013150 (2012)","journal-title":"Optim."},{"key":"28_CR4","first-page":"897","volume-title":"17th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Y. Doids","year":"1999","unstructured":"Doids, Y., Guruswami, V., Khanna, S.: The 2-Catalog Segmentation Problem. In: 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 897\u2013898. SIAM Press, Baltimore (1999)"},{"key":"28_CR5","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 RPR2 Rounding Technique for Semidefinite Programs. J. Algorithms\u00a060, 1\u201323 (2006)","journal-title":"J. Algorithms"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Feo, T., Goldschmidt, O., Khellaf, M.: One-Half Approximation Algorithms for the k-Partition Problem. Oper. Res. 40, S170\u2013S173 (1992)","DOI":"10.1287\/opre.40.1.S170"},{"key":"28_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\u00a018, 67\u201381 (1997)","journal-title":"Algorithmica"},{"key":"28_CR8","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.S.: A Polynomail Algorithm for the k-Cut Problem for Fixed k. Math. Oper. Res.\u00a019, 24\u201337 (1994)","journal-title":"Math. Oper. Res."},{"key":"28_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 Problems Using Semidefinite Programming. J. ACM\u00a042, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"28_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.\u00a068, 442\u2013470 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_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 Structures & Algorithms\u00a020, 382\u2013402 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s101070100288","volume":"92","author":"Q. Han","year":"2002","unstructured":"Han, Q., Ye, Y., Zhang, J.: An Improved Rounding Method and Semidefinite Programming Relaxation for Graph Partition. Math. Program. Ser. B\u00a092, 509\u2013535 (2002)","journal-title":"Math. Program. Ser. B"},{"key":"28_CR13","first-page":"473","volume-title":"30th Annual ACM Symposium on the Theory of Computing","author":"J. Kleinberg","year":"1998","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation Problems. In: 30th Annual ACM Symposium on the Theory of Computing, pp. 473\u2013482. ACM Press, Dallas (1998)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"J.B. Lasserre","year":"2002","unstructured":"Lasserre, J.B.: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs. SIAM J. Optim.\u00a012, 756\u2013769 (2002)","journal-title":"SIAM J. Optim."},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-02026-1_20","volume-title":"Combinatorial Optimization and Applications","author":"A.-F. Ling","year":"2009","unstructured":"Ling, A.-F.: Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol.\u00a05573, pp. 219\u2013230. Springer, Heidelberg (2009)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/1.9781611973099.33","volume-title":"23rd Annual ACM-SIAM Symposium on Discrete Algorithms","author":"P. Raghavendra","year":"2012","unstructured":"Raghavendra, P., Tan, N.: Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 373\u2013387. SIAM Press, Kyoto (2012)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-Complete Approximation Problems. J. ACM\u00a023, 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"28_CR18","unstructured":"Wu, C., Du, D., Xu, D.: An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems. J. Comb. Optim. (2013), doi 10.1007\/s10878-013-9673-1"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1023\/A:1026094110647","volume":"27","author":"D. Xu","year":"2003","unstructured":"Xu, D., Han, J., Huang, Z., Zhang, L.: Improved Approximation Algorithms for MAX n\/2-DIRECTED-BISECTION and MAX n\/2-DENSE-SUBGRAPH. J. Glob. Optim.\u00a027, 399\u2013410 (2003)","journal-title":"J. Glob. Optim."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Ye, Y.: A.699-Approximation Algorithm for Max-Bisection. Math. Program. 90, 101-111 (2001)","DOI":"10.1007\/PL00011415"},{"key":"28_CR21","first-page":"679","volume-title":"31st Annual ACM Symposium on Theory of Computing","author":"U. Zwick","year":"1999","unstructured":"Zwick, U.: Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems. In: 31st Annual ACM Symposium on Theory of Computing, pp. 679\u2013687. ACM Press, Atlanta (1999)"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1137\/04061341X","volume":"16","author":"S. Zhang","year":"2006","unstructured":"Zhang, S., Huang, Y.: Complex Quadratic Optimization and Semidefinite Programming. SIAM J. Optim.\u00a016, 871\u2013890 (2006)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:56:59Z","timestamp":1558925819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}