{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T10:22:57Z","timestamp":1787394177595,"version":"build-2736575974"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2023J01414"],"award-info":[{"award-number":["2023J01414"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFA1010202"],"award-info":[{"award-number":["2023YFA1010202"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571336"],"award-info":[{"award-number":["12571336"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.tcs.2026.116133","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:22:56Z","timestamp":1781911376000},"page":"116133","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximating total effective resistance minimization with small budget"],"prefix":"10.1016","volume":"1083","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9354-3452","authenticated-orcid":false,"given":"Yun","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0784-4073","authenticated-orcid":false,"given":"Hong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2026.116133_bib0001","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/S0097539792236237","article-title":"When trees collide: an approximation algorithm for the generalized Steiner problem on networks","volume":"24","author":"Agrawal","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.116133_bib0002","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s004930170004","article-title":"A factor 2 approximation algorithm for the generalized Steiner network problem","volume":"21","author":"Jain","year":"2001","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/j.tcs.2026.116133_bib0003","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/net.20289","article-title":"Approximating the smallest k-edge connected spanning subgraph by LP-rounding","volume":"53","author":"Gabow","year":"2009","journal-title":"Networks"},{"issue":"1\u20134","key":"10.1016\/j.tcs.2026.116133_bib0004","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01164627","article-title":"Resistance distance","volume":"12","author":"Klein","year":"1993","journal-title":"J. Math. Chem."},{"issue":"1","key":"10.1016\/j.tcs.2026.116133_bib0005","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/JSAC.2010.100105","article-title":"Autonomic traffic engineering for network robustness","volume":"28","author":"Tizghadam","year":"2009","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"10.1016\/j.tcs.2026.116133_bib0006","doi-asserted-by":"crossref","first-page":"2512","DOI":"10.1109\/TNET.2015.2475616","article-title":"On the efficiency of social recommender networks","volume":"24","author":"Wong","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.tcs.2026.116133_bib0007","series-title":"International Conference on Machine Learning","first-page":"2528","article-title":"Understanding oversquashing in GNNs through the lens of effective resistance","author":"Black","year":"2023"},{"issue":"4","key":"10.1016\/j.tcs.2026.116133_bib0008","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TCNS.2014.2357552","article-title":"Consensus and coherence in fractal networks","volume":"1","author":"Patterson","year":"2014","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"2","key":"10.1016\/j.tcs.2026.116133_bib0009","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TCYB.2017.2781714","article-title":"Consensus in self-similar hierarchical graphs and sierpi\u0144ski graphs: convergence speed, delay robustness, and coherence","volume":"49","author":"Qi","year":"2018","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"10.1016\/j.tcs.2026.116133_bib0010","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TCYB.2018.2868124","article-title":"Scale-free loopy structure is resistant to noise in consensus dynamics in complex networks","volume":"50","author":"Yi","year":"2018","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"10.1016\/j.tcs.2026.116133_bib0011","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/050645452","article-title":"Minimizing effective resistance of a graph","volume":"50","author":"Ghosh","year":"2008","journal-title":"SIAM Rev."},{"key":"10.1016\/j.tcs.2026.116133_bib0012","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1017\/S0962492924000023","article-title":"Optimal experimental design: formulations and computations","volume":"33","author":"Huan","year":"2024","journal-title":"Acta Numer."},{"issue":"4","key":"10.1016\/j.tcs.2026.116133_bib0013","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","article-title":"The complexity of the network design problem","volume":"8","author":"Johnson","year":"1978","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.tcs.2026.116133_bib0014","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/S009753979732253X","article-title":"A polynomial-time approximation scheme for minimum routing cost spanning trees","volume":"29","author":"Wu","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2026.116133_bib0015","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1137\/20M1386542","article-title":"A local search framework for experimental design","volume":"51","author":"Lau","year":"2022","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2026.116133_bib0016","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.laa.2006.08.034","article-title":"Subset selection for matrices","volume":"422","author":"de Hoog","year":"2007","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"10.1016\/j.tcs.2026.116133_bib0017","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1137\/120867287","article-title":"Faster subset selection for matrices and applications","volume":"34","author":"Avron","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1\u20132, Ser. A","key":"10.1016\/j.tcs.2026.116133_bib0018","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10107-019-01464-2","article-title":"Near-optimal discrete optimization for experimental design: a regret minimization approach","volume":"186","author":"Allen-Zhu","year":"2021","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.tcs.2026.116133_bib0019","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/moor.2021.1129","article-title":"Proportional volume sampling and approximation algorithms for A-optimal design","volume":"47","author":"Nikolov","year":"2022","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.tcs.2026.116133_bib0020","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/3522588","article-title":"Network design for s-t effective resistance","volume":"18","author":"Chan","year":"2022","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"10.1016\/j.tcs.2026.116133_bib0021","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.orl.2023.10.002","article-title":"Minimizing the effective graph resistance by adding links is NP-hard","volume":"51","author":"Kooij","year":"2023","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2026.116133_bib0022","article-title":"Efficient algorithms for minimizing the Kirchhoff index via adding edges","author":"Zhou","year":"2025","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.tcs.2026.116133_bib0023","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1214\/aoms\/1177729893","article-title":"Adjustment of an inverse matrix corresponding to a change in one element of a given matrix","volume":"21","author":"Sherman","year":"1950","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"10.1016\/j.tcs.2026.116133_bib0024","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1137\/0601008","article-title":"Worst-case analysis of network design problem heuristics","volume":"1","author":"Wong","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"10.1016\/j.tcs.2026.116133_bib0025","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAXSNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003622?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003622?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T09:25:02Z","timestamp":1787390702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":25,"alternative-id":["S0304397526003622"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116133","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximating total effective resistance minimization with small budget","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116133","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116133"}}