{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:12:34Z","timestamp":1770282754359,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031360299","type":"print"},{"value":"9783031360305","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36030-5_11","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T17:02:13Z","timestamp":1687971733000},"page":"138-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["GCS-Q: Quantum Graph Coalition Structure Generation"],"prefix":"10.1007","author":[{"given":"Supreeth Mysore","family":"Venkatesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Macaluso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Klusch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"11_CR1","unstructured":"Aziz, H., De Keijzer, B.: Complexity of coalition structure generation. arXiv preprint arXiv:1101.1007 (2011)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Kohli, P., Kolmogorov, V., Zadimoghaddam, M.: Optimal coalition structure generation in cooperative graph games. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8653"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bistaffa, F., Chalkiadakis, G., Farinelli, A.: Efficient coalition structure generation via approximately equivalent induced subgraph games. IEEE Trans. Cybern. (2021)","DOI":"10.1109\/TCYB.2020.3040622"},{"key":"11_CR4","unstructured":"Bistaffa, F., Farinelli, A., Cerquides, J., Rodriguez-Aguilar, J.A., Ramchurn, S.D.: Anytime coalition structure generation on synergy graphs. In: 13th International Conference on Autonomous Agents and Multi-agent Systems, 5\u20139 May 2014 (2014)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Changder, N., Aknine, S., Ramchurn, S.D., Dutta, A.: BOSS: a bi-directional search technique for optimal coalition structure generation with minimal overlapping. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 15765\u201315766 (2021)","DOI":"10.1609\/aaai.v35i18.17879"},{"key":"11_CR6","unstructured":"Farinelli, A., Bicego, M., Ramchurn, S., Zuchelli, M.: C-link: a hierarchical clustering approach to large-scale near-optimal coalition formation. In: 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), 3\u20139 August 2013 (2013)"},{"key":"11_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.ejor.2014.11.033","volume":"243","author":"E Gonz\u00e1lez-Arang\u00fcena","year":"2015","unstructured":"Gonz\u00e1lez-Arang\u00fcena, E., Manuel, C.M., del Pozo, M.: Values of games with weighted graphs. Eur. J. Oper. Res. 243(1), 248\u2013257 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR9","unstructured":"Mccormick, S.T., Rao, M., Rinaldi, G.: When is min cut with negative edges easy to solve? Easy and difficult objective functions for max cut. Consiglio Nazionale Delle Ricerche (CNR) (2000)"},{"key":"11_CR10","unstructured":"McGeoch, C., Farr\u00e9, P.: The D-wave advantage system: an overview. D-Wave Systems Inc., Burnaby, BC, Canada, Technical report (2020)"},{"key":"11_CR11","unstructured":"Rahwan, T., Jennings, N.R.: Coalition structure generation: dynamic programming meets anytime optimization. In: AAAI Conference on Artificial Intelligence (2008)"},{"key":"11_CR12","unstructured":"Rahwan, T., Jennings, N.R.: An improved dynamic programming algorithm for coalition structure generation. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3, pp. 1417\u20131420 (2008)"},{"key":"11_CR13","unstructured":"Rahwan, T., Ramchurn, S.D., Dang, V.D., Giovannucci, A., Jennings, N.R.: Anytime optimal coalition structure generation. In: AAAI, vol. 7, pp. 1184\u20131190 (2007)"},{"issue":"1\u20132","key":"11_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0004-3702(99)00036-3","volume":"111","author":"T Sandholm","year":"1999","unstructured":"Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohm\u00e9, F.: Coalition structure generation with worst case guarantees. Artif. Intell. 111(1\u20132), 209\u2013238 (1999)","journal-title":"Artif. Intell."},{"key":"11_CR15","unstructured":"Tasseff, B., et al.: On the emerging potential of quantum annealing hardware for combinatorial optimization. arXiv preprint arXiv:2210.04291 (2022)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Venkatesh, S.M., Macaluso, A., Klusch, M.: BILP-Q: quantum coalition structure generation. In: Proceedings of the 19th ACM International Conference on Computing Frontiers, pp. 189\u2013192 (2022)","DOI":"10.1145\/3528416.3530235"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1613\/jair.3715","volume":"45","author":"T Voice","year":"2012","unstructured":"Voice, T., Polukarov, M., Jennings, N.R.: Coalition structure generation over graphs. J. Artif. Intell. Res. 45, 165\u2013196 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"11_CR18","unstructured":"Voice, T., Ramchurn, S.D., Jennings, N.R.: On coalition formation with sparse synergies. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 223\u2013230. International Foundation for Autonomous Agents and Multiagent Systems (2012)"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-022-03476-y","volume":"21","author":"D Willsch","year":"2022","unstructured":"Willsch, D., et al.: Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems. Quantum Inf. Process. 21(4), 1\u201322 (2022)","journal-title":"Quantum Inf. Process."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36030-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T01:03:26Z","timestamp":1716512606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36030-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360299","9783031360305"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36030-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"All code to generate the data, figures, analyses and additional technical details on the experiments are available at .","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"530","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"188","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}