{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:43:18Z","timestamp":1725453798022},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_28","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:31:28Z","timestamp":1368750688000},"page":"304-315","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems"],"prefix":"10.1007","author":[{"given":"Chenchen","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Austrin, P., Benabbas, S., Georgiou, K.: Better balance by being biased: a 0.8776-approximation for max bisection. In: Proceedings of SODA, pp. 277\u2013294 (2013), Full version available as arXiv eprint 1205.0458v2","DOI":"10.1137\/1.9781611973105.21"},{"key":"28_CR2","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. Journal of Algorithms\u00a060, 1\u201323 (2006)","journal-title":"Journal of Algorithms"},{"key":"28_CR3","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_CR4","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. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"key":"28_CR5","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_CR6","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. Mathematical Programming, Series B\u00a092, 509\u2013535 (2002)","journal-title":"Mathematical Programming, Series B"},{"key":"28_CR7","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 Journal on Optimization\u00a012, 756\u2013769 (2002)","journal-title":"SIAM Journal on Optimization"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Tan, N.: Approximating CSPs with global cardinality constraints using SDP hierarchies. In: Proceedings of SODA, pp. 373\u2013387 (2012), Full version available as arXiv eprint 1110.1064v1","DOI":"10.1137\/1.9781611973099.33"},{"key":"28_CR9","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. Journal of Global Optimization\u00a027, 399\u2013410 (2003)","journal-title":"Journal of Global Optimization"},{"key":"28_CR10","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. Mathematical Programming\u00a090, 101\u2013111 (2001)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:19:00Z","timestamp":1557699540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}