{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:26:35Z","timestamp":1758392795375,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"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":[[2020,12]]},"DOI":"10.1109\/gcwkshps50303.2020.9367437","type":"proceedings-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T20:59:31Z","timestamp":1614977971000},"page":"1-6","source":"Crossref","is-referenced-by-count":5,"title":["Solving the Minimum Spanning Tree Problem with a Quantum Annealer"],"prefix":"10.1109","author":[{"given":"Wesley","family":"O'Quinn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiwen","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.57"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/BROADNETS.2004.50"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2006.879845"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.37"},{"key":"ref14","first-page":"2657","article-title":"CHSMST: A clustering algorithm based on hyper surface and minimum spanning tree","volume":"15","author":"he","year":"2008","journal-title":"Soft Computing-Springer"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000022288.19776.77"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ipr.2013.0104"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900341"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.031015"},{"key":"ref19","article-title":"Comparison of D-wave quantum annealing and classical simulated annealing for local minima determination","author":"koshka","year":"2019","journal-title":"arXiv 1911 03338"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00224-7","article-title":"Otakar bor?vka on minimum spanning tree problem translation of both the 1926 papers, comments, history","volume":"233","author":"ne\u0161et?il","year":"2001","journal-title":"Discrete Mathematics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25977-0_30"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2033241"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2924243"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.07.038"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2006.83"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.57"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/713427"},{"journal-title":"D-Wave the Quantum Computing Company","year":"0","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/681\/1\/012005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3149526.3149531"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-60022-5"},{"key":"ref23","article-title":"Analyzing the quantum annealing approach for solving linear least squares problems","author":"borle","year":"2018","journal-title":"arXiv 1809 07649"}],"event":{"name":"2020 IEEE Globecom Workshops (GC Wkshps)","start":{"date-parts":[[2020,12,7]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2020,12,11]]}},"container-title":["2020 IEEE Globecom Workshops (GC Wkshps"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9367371\/9367388\/09367437.pdf?arnumber=9367437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:54:58Z","timestamp":1656345298000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9367437\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/gcwkshps50303.2020.9367437","relation":{},"subject":[],"published":{"date-parts":[[2020,12]]}}}