{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T18:24:44Z","timestamp":1765045484546,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T00:00:00Z","timestamp":1652745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Ministry for Education and Research (BMB+F)","award":["13N15586"],"award-info":[{"award-number":["13N15586"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,17]]},"DOI":"10.1145\/3528416.3530235","type":"proceedings-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T02:16:59Z","timestamp":1651717019000},"page":"189-192","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["BILP-Q"],"prefix":"10.1145","author":[{"given":"Supreeth Mysore","family":"Venkatesh","sequence":"first","affiliation":[{"name":"University of Saarland, Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Macaluso","sequence":"additional","affiliation":[{"name":"German Research Center for Artificial Intelligence (DFKI), Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Klusch","sequence":"additional","affiliation":[{"name":"German Research Center for Artificial Intelligence (DFKI), Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3040967"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i18.17879"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749914300022"},{"key":"e_1_3_2_1_4_1","volume-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419","author":"Crooks Gavin E","year":"2018","unstructured":"Gavin E Crooks. 2018. Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419 (2018)."},{"key":"e_1_3_2_1_5_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv: 1411.4028","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv: 1411.4028 (2014)."},{"key":"e_1_3_2_1_6_1","volume-title":"QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific reports 9, 1","author":"Guerreschi Gian Giacomo","year":"2019","unstructured":"Gian Giacomo Guerreschi and Anne Y Matsuura. 2019. QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific reports 9, 1 (2019), 1--7."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-003-0153-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/17517575.2018.1552993"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67074-4_32"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387902.3394032"},{"key":"e_1_3_2_1_11_1","volume-title":"Optimizing ansatz design in qaoa for max-cut. arXiv preprint arXiv:2106.02812","author":"Majumdar Ritajit","year":"2021","unstructured":"Ritajit Majumdar, Dhiraj Madan, Debasmita Bhoumik, Dhinakaran Vinayagamurthy, Shesha Raghunathan, and Susmita Sur-Kolay. 2021. Optimizing ansatz design in qaoa for max-cut. arXiv preprint arXiv:2106.02812 (2021)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2863030"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 3. 1417--1420","author":"Rahwan Talal","year":"2008","unstructured":"Talal Rahwan and Nicholas R Jennings. 2008. An improved dynamic programming algorithm for coalition structure generation. In Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 3. 1417--1420."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.08.004"},{"key":"e_1_3_2_1_15_1","first-page":"1184","article-title":"Anytime optimal coalition structure generation","volume":"7","author":"Rahwan Talal","year":"2007","unstructured":"Talal Rahwan, Sarvapali D Ramchurn, Viet Dung Dang, Andrea Giovannucci, and Nicholas R Jennings. 2007. Anytime optimal coalition structure generation. In AAAI, Vol. 7. 1184--1190.","journal-title":"AAAI"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-02692-8"},{"key":"e_1_3_2_1_17_1","volume-title":"Combinatorial optimization on gate model quantum computers: A survey. arXiv.1708.05294","author":"Zahedinejad Ehsan","year":"2017","unstructured":"Ehsan Zahedinejad and Arman Zaribafiyan. 2017. Combinatorial optimization on gate model quantum computers: A survey. arXiv.1708.05294 (2017)."}],"event":{"name":"CF '22: 19th ACM International Conference on Computing Frontiers","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"],"location":"Turin Italy","acronym":"CF '22"},"container-title":["Proceedings of the 19th ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528416.3530235","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528416.3530235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:42Z","timestamp":1750186962000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528416.3530235"}},"subtitle":["quantum coalition structure generation"],"short-title":[],"issued":{"date-parts":[[2022,5,17]]},"references-count":17,"alternative-id":["10.1145\/3528416.3530235","10.1145\/3528416"],"URL":"https:\/\/doi.org\/10.1145\/3528416.3530235","relation":{},"subject":[],"published":{"date-parts":[[2022,5,17]]},"assertion":[{"value":"2022-05-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}