{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:58:00Z","timestamp":1729652280684,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/paap.2011.35","type":"proceedings-article","created":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T11:36:20Z","timestamp":1330601780000},"page":"236-240","source":"Crossref","is-referenced-by-count":3,"title":["A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph"],"prefix":"10.1109","author":[{"given":"Wenxing","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Chuanyin","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Approximation Algorithms","year":"2001","author":"vazirani","key":"19"},{"journal-title":"Computational Complexity","year":"1994","author":"papadimitriou","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"journal-title":"Combinatorial Optimization Theory and Algorithms","year":"2008","author":"korte","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796309326"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/cjtcs.1997.002","article-title":"On the hardness of approximating MAX k-CUT and its dual","volume":"2","author":"kann","year":"1997","journal-title":"Chicago Journal of Theoretical Computer Science"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.07.012"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45253-2_4"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011415"},{"key":"2","first-page":"17","article-title":"Approximation algorithms for maximum coverage and max cut with given sizes of parts","author":"ageev","year":"1999","journal-title":"Integer Programming and Combinatorial Optimization Volume 1610 of Lecture Notes in Computer Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010036813X"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0139-z"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038911.67280.3f"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1605"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00021-0"},{"key":"4","first-page":"237","article-title":"An approximation algorithm for max p-section","author":"andersson","year":"1999","journal-title":"STACS 99 Volume 1563 of Lecture Notes in Computer Science"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523688"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1183"}],"event":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","start":{"date-parts":[[2011,12,9]]},"location":"Tianjin, China","end":{"date-parts":[[2011,12,11]]}},"container-title":["2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6126156\/6128460\/06128509.pdf?arnumber=6128509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T11:03:40Z","timestamp":1497956620000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6128509\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/paap.2011.35","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}