{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T05:06:29Z","timestamp":1741323989583,"version":"3.38.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T00:00:00Z","timestamp":1736121600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T00:00:00Z","timestamp":1736121600000},"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":[[2025,1,6]]},"DOI":"10.1109\/ccwc62904.2025.10903839","type":"proceedings-article","created":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T18:40:30Z","timestamp":1741200030000},"page":"00095-00102","source":"Crossref","is-referenced-by-count":0,"title":["Construction of Bounded-Degree Minimum-Radius Spanning Trees for WSNs"],"prefix":"10.1109","author":[{"given":"Min Kyung","family":"An","sequence":"first","affiliation":[{"name":"Sam Houston State University Huntsville,Department of Computer Science,Texas,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyuk","family":"Cho","sequence":"additional","affiliation":[{"name":"Sam Houston State University Huntsville,Department of Computer Science,Texas,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IEMCON.2018.8615099"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2010.5466684"},{"volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","year":"1990","author":"Garey","key":"ref3"},{"key":"ref4","first-page":"317","article-title":"Approximating the Minimum Degree Spanning Tree to within One from the Optimal Degree","author":"Furer","year":"1992","journal-title":"Discrete Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49014-3_45"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.48"},{"key":"ref7","article-title":"Distributed Algorithms for Minimum Degree Spanning Trees","author":"Cornejo","year":"2018","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970036917X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250887"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-023-01295-8"},{"key":"ref11","first-page":"1","article-title":"Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP","volume":"248","author":"Friggstad","year":"2022","journal-title":"Algorithms and Computation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591837"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0220060"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00183-Y"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0137040"},{"issue":"2\u20133","key":"ref17","first-page":"89","article-title":"An Approximation Algorithm for the Minimum Diameter Spanning Tree Problem","volume":"76","author":"Dragan","year":"2000","journal-title":"Information Processing Letters"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2146273"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.05.033"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365693"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1121-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MOBHOC.2009.5336978"},{"volume-title":"Introduction to Algorithms","year":"2009","author":"Cormen","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019411"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.380"}],"event":{"name":"2025 IEEE 15th Annual Computing and Communication Workshop and Conference (CCWC)","start":{"date-parts":[[2025,1,6]]},"location":"Las Vegas, NV, USA","end":{"date-parts":[[2025,1,8]]}},"container-title":["2025 IEEE 15th Annual Computing and Communication Workshop and Conference (CCWC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10903549\/10903552\/10903839.pdf?arnumber=10903839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T06:18:58Z","timestamp":1741241938000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10903839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/ccwc62904.2025.10903839","relation":{},"subject":[],"published":{"date-parts":[[2025,1,6]]}}}