{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:41:46Z","timestamp":1725601306371},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T00:00:00Z","timestamp":1655856000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T00:00:00Z","timestamp":1655856000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,22]]},"DOI":"10.1109\/jcsse54890.2022.9836261","type":"proceedings-article","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T19:47:39Z","timestamp":1659037659000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["MAX-CUT on Samplings of Dense Graphs"],"prefix":"10.1109","author":[{"given":"Jittat","family":"Fakcharoenphol","sequence":"first","affiliation":[{"name":"Kasetsart University,Department of Computer Engineering,Bangkok,Thailand"}]},{"given":"Phanu","family":"Vajanopath","sequence":"additional","affiliation":[{"name":"Kasetsart University,Department of Computer Engineering,Bangkok,Thailand"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1605"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050052"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00008-4"},{"key":"ref14","first-page":"176","article-title":"Yet another algorithm for dense max cut: go greedy","author":"mathieu","year":"2008","journal-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00133-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006303"},{"key":"ref18","first-page":"181","article-title":"Graph bisection algorithins with good average case behavior","author":"bui","year":"1984","journal-title":"Foundations of Computer Science 1984 25th Annual Symposium on"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref3","first-page":"1657","article-title":"Maximizing agreements for ranking, clustering and hierarchical clustering via MAX-CUT","author":"chatziafratis","year":"2021","journal-title":"The 24th International Conference on Artificial Intelligence and Statistics AISTATS 2021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447372"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/CCC.2002.1004334","article-title":"On the power of unique 2-prover 1-round games","author":"khot","year":"2002","journal-title":"Computational Complexity Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ympev.2011.06.021"},{"key":"ref1","article-title":"Maximum cuts and largest bipartite subgraphs","author":"poljak","year":"1993","journal-title":"Combinatorial Optimization"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<187::AID-RSA3>3.0.CO;2-U"},{"journal-title":"Probability and computing Random-ization and probabilistic techniques in algorithms and data analysis","year":"2017","author":"mitzenmacher","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195422"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90084-0"}],"event":{"name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","start":{"date-parts":[[2022,6,22]]},"location":"Bangkok, Thailand","end":{"date-parts":[[2022,6,25]]}},"container-title":["2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9836023\/9836237\/09836261.pdf?arnumber=9836261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T20:06:39Z","timestamp":1661198799000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9836261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,22]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/jcsse54890.2022.9836261","relation":{},"subject":[],"published":{"date-parts":[[2022,6,22]]}}}