{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:45:08Z","timestamp":1772552708398,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,31]],"date-time":"2013-10-31T00:00:00Z","timestamp":1383177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9673-1","type":"journal-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T04:56:46Z","timestamp":1383109006000},"page":"53-66","source":"Crossref","is-referenced-by-count":7,"title":["An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems"],"prefix":"10.1007","volume":"29","author":[{"given":"Chenchen","family":"Wu","sequence":"first","affiliation":[]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,31]]},"reference":[{"key":"9673_CR1","unstructured":"Austrin P, Benabbas S, Georgiou K (2013) Better balance by being biased: a $$0.8776$$ 0.8776 -approximation for max bisection. In: Proceedings of SODA, pp 277\u2013294"},{"key":"9673_CR2","doi-asserted-by":"crossref","unstructured":"Bhaskara A, Charikar M, Vijayaraghavan A, Guruswami V, Zhou Y (2012) Polynomial integrality gaps for strong SDP relaxations of Densest $$k$$ k -subgraph. In: Proceeding of SODA, pp 388\u2013405","DOI":"10.1137\/1.9781611973099.34"},{"key":"9673_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2004.11.003","volume":"60","author":"U Feige","year":"2006","unstructured":"Feige U, Langberg M (2006) The $$\\text{ RPR }^2$$ RPR 2 rounding technique for semidefinite programs. J Algor 60:1\u201323","journal-title":"J Algor"},{"key":"9673_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"AM Frieze","year":"1997","unstructured":"Frieze AM, Jerrum M (1997) Improved approximation algorithms for MAX $$k$$ k -CUT and MAX BISECTION. Algorithmica 18:67\u201381","journal-title":"Algorithmica"},{"key":"9673_CR5","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115\u20131145","journal-title":"J ACM"},{"key":"9673_CR6","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1002\/rsa.10035","volume":"20","author":"E Halperin","year":"2002","unstructured":"Halperin E, Zwick U (2002) A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Struct Algor 20:382\u2013402","journal-title":"Random Struct Algor"},{"key":"9673_CR7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s101070100288","volume":"92","author":"Q Han","year":"2002","unstructured":"Han Q, Ye Y, Zhang J (2002) An improved rounding method and semidefinite programming relaxation for graph partition. Math Program Ser B 92:509\u2013535","journal-title":"Math Program Ser B"},{"key":"9673_CR8","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"JB Lasserre","year":"2002","unstructured":"Lasserre JB (2002) An explicit equivalent positive semidefinite program for nonlinear 0\u20131 programs. SIAM J Optim 12:756\u2013769","journal-title":"SIAM J Optim"},{"key":"9673_CR9","doi-asserted-by":"crossref","unstructured":"Raghavendra P, Tan N (2012) Approximating CSPs with global cardinality constraints using SDP hierarchies. In: Proceedings of SODA, pp 373\u2013387","DOI":"10.1137\/1.9781611973099.33"},{"key":"9673_CR10","doi-asserted-by":"crossref","unstructured":"Wu C, Du D, Xu D (2013) An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems. In: Proceedings of COCOON, pp 304\u2013315","DOI":"10.1007\/978-3-642-38768-5_28"},{"key":"9673_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1026094110647","volume":"27","author":"D Xu","year":"2003","unstructured":"Xu D, Han J, Huang Z, Zhang L (2003) Improved approximation algorithms for MAX $$n\/2$$ n \/ 2 -DIRECTED-BISECTION and MAX $$n\/2$$ n \/ 2 -DENSE-SUBGRAPH. J Global Optim 27:399\u2013410","journal-title":"J Global Optim"},{"key":"9673_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/PL00011415","volume":"90","author":"Y Ye","year":"2001","unstructured":"Ye Y (2001) A $$.699$$ . 699 -approximation algorithm for Max-Bisection. Math Program 90:101\u2013111","journal-title":"Math Program"},{"key":"9673_CR13","doi-asserted-by":"crossref","unstructured":"Zhu Y, Wu W, Bi Y, Wu L, Jiang Y, Xu W (2013) Better approximation algorithms for influence maximization in online social networks. J Comb Optim. doi: 10.1007\/s10878-013-9635-7","DOI":"10.1007\/s10878-013-9635-7"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9673-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9673-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9673-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T14:42:31Z","timestamp":1564584151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9673-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,31]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9673"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9673-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,31]]}}}