{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:46:07Z","timestamp":1776883567559,"version":"3.51.2"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872093"],"award-info":[{"award-number":["61872093"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R & D Program of China","award":["2018YFB1305104"],"award-info":[{"award-number":["2018YFB1305104"]}]},{"name":"Shanghai Municipal Science and Technology Major Project","award":["2018SHZDZX01"],"award-info":[{"award-number":["2018SHZDZX01"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1527287"],"award-info":[{"award-number":["CNS-1527287"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1553340"],"award-info":[{"award-number":["CNS-1553340"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1109\/tit.2019.2940263","type":"journal-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T20:05:31Z","timestamp":1568232331000},"page":"1248-1260","source":"Crossref","is-referenced-by-count":17,"title":["Maximizing the Number of Spanning Trees in a Connected Graph"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7840-1053","authenticated-orcid":false,"given":"Huan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7711-6018","authenticated-orcid":false,"given":"Stacy","family":"Patterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6036-0276","authenticated-orcid":false,"given":"Yuhao","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1260-2079","authenticated-orcid":false,"given":"Zhongzhi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.44"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.90"},{"key":"ref33","article-title":"Near-optimal discrete optimization for experimental design: A regret minimization approach","author":"allen-zhu","year":"2017","journal-title":"arXiv 1711 05174"},{"key":"ref32","first-page":"2240","article-title":"Approximate positive correlated distributions and approximation algorithms for D-optimal design","author":"singh","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s00453-011-9582-6","article-title":"Exponential inapproximability of selecting a maximum volume sub-matrix","volume":"65","author":"\u00e7ivril","year":"2013","journal-title":"Algorithmica"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.05.006"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377282"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.06.001"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806699"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487264"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897649"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80028-7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746628"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906065387"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313490"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref21","author":"stolarksy","year":"1987","journal-title":"Random Walks and Electric Networks"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.12988\/ams.2014.45374"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00095-4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240504"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_17"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/24.690884"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188852"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7403083"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2764447"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2453711"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055499"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623626"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939869"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906072768"},{"key":"ref3","article-title":"Maximizing the weighted number of spanning trees: Near-t-optimal graphs","author":"khosoussi","year":"2016","journal-title":"arXiv 1604 01116"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1972.1091214"},{"key":"ref5","author":"colbourn","year":"1987","journal-title":"The Combinatorics of Network Reliability"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400448"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.1.1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00285-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/24.370220"},{"key":"ref46","first-page":"2377","article-title":"Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms","author":"li","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316379"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/b98818"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF01164627"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/2743021","article-title":"Faster spectral sparsification and numerical algorithms for SDD matrices","volume":"12","author":"koutis","year":"2016","journal-title":"ACM Trans Algorithms"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00042"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591833"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8963777\/8831406-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8963777\/08831406.pdf?arnumber=8831406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:27:41Z","timestamp":1651080461000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8831406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":50,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2940263","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}