{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:40:47Z","timestamp":1767318047433,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-4839-2_24","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:38:19Z","timestamp":1767317899000},"page":"304-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Total Effective Resistance Minimization with Small Budget"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9354-3452","authenticated-orcid":false,"given":"Yun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0784-4073","authenticated-orcid":false,"given":"Hong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized steiner problem on networks. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 134\u2013144 (1991). https:\/\/doi.org\/10.1145\/103418.103437","DOI":"10.1145\/103418.103437"},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Allen-Zhu, Z., Li, Y., Singh, A., Wang, Y.: Near-optimal discrete optimization for experimental design: a regret minimization approach. Math. Program. 186, 439\u2013478 (2021). https:\/\/doi.org\/10.1007\/s10107-019-01464-2","DOI":"10.1007\/s10107-019-01464-2"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/120867287","volume":"34","author":"H Avron","year":"2013","unstructured":"Avron, H., Boutsidis, C.: Faster subset selection for matrices and applications. SIAM J. Matrix Anal. Appl. 34(4), 1464\u20131499 (2013). https:\/\/doi.org\/10.1137\/120867287","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"24_CR4","unstructured":"Black, M., Wan, Z., Nayyeri, A., Wang, Y.: Understanding oversquashing in GNNs through the lens of effective resistance. In: International Conference on Machine Learning, pp. 2528\u20132547. PMLR (2023)"},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Chan, P.H., Lau, L.C., Schild, A., Wong, S.C.W., Zhou, H.: Network design for S-T effective resistance. ACM Trans. Algorithms (TALG) 18(3), 1\u201345 (2022). https:\/\/doi.org\/10.1145\/3522588","DOI":"10.1145\/3522588"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Gabow, H.N., Goemans, M.X., Tardos, \u00c9., Williamson, D.P.: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Netw. Int. J. 53(4), 345\u2013357 (2009). https:\/\/doi.org\/10.1002\/net.20289","DOI":"10.1002\/net.20289"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/050645452","volume":"50","author":"A Ghosh","year":"2008","unstructured":"Ghosh, A., Boyd, S., Saberi, A.: Minimizing effective resistance of a graph. SIAM Rev. 50(1), 37\u201366 (2008). https:\/\/doi.org\/10.1137\/050645452","journal-title":"SIAM Rev."},{"issue":"2\u20133","key":"24_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.laa.2006.08.034","volume":"422","author":"FR de Hoog","year":"2007","unstructured":"de Hoog, F.R., Mattheij, R.M.M.: Subset selection for matrices. Linear Algebra Appl. 422(2\u20133), 349\u2013359 (2007). https:\/\/doi.org\/10.1016\/j.laa.2006.08.034","journal-title":"Linear Algebra Appl."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1017\/S0962492924000023","volume":"33","author":"X Huan","year":"2024","unstructured":"Huan, X., Jagalur, J., Marzouk, Y.: Optimal experimental design: formulations and computations. Acta Numer 33, 715\u2013840 (2024). https:\/\/doi.org\/10.1017\/S0962492924000023","journal-title":"Acta Numer"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica 21, 39\u201360 (2001). https:\/\/doi.org\/10.1007\/s004930170004","journal-title":"Combinatorica"},{"issue":"4","key":"24_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"DS Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Kan, A.R.: The complexity of the network design problem. Networks 8(4), 279\u2013285 (1978). https:\/\/doi.org\/10.1002\/net.3230080402","journal-title":"Networks"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded $$3$$-dimensional matching is $${\\rm MAX}$$$${\\rm SNP}$$-complete. Inform. Process. Lett. 37(1), 27\u201335 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90246-E","journal-title":"Inform. Process. Lett."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Klein, D.J., Randi\u0107, M.: Resistance distance, vol.\u00a012, pp. 81\u201395 (1993), applied graph theory and discrete mathematics in chemistry (Saskatoon, SK, 1991)","DOI":"10.1007\/BF01164627"},{"issue":"6","key":"24_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.orl.2023.10.002","volume":"51","author":"RE Kooij","year":"2023","unstructured":"Kooij, R.E., Achterberg, M.A.: Minimizing the effective graph resistance by adding links is np-hard. Oper. Res. Lett. 51(6), 601\u2013604 (2023). https:\/\/doi.org\/10.1016\/j.orl.2023.10.002","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1137\/20M1386542","volume":"51","author":"LC Lau","year":"2022","unstructured":"Lau, L.C., Zhou, H.: A local search framework for experimental design. SIAM J. Comput. 51(4), 900\u2013951 (2022). https:\/\/doi.org\/10.1137\/20M1386542","journal-title":"SIAM J. Comput."},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/moor.2021.1129","volume":"47","author":"A Nikolov","year":"2022","unstructured":"Nikolov, A., Singh, M., Tantipongpipat, U.: Proportional volume sampling and approximation algorithms for $$A$$-optimal design. Math. Oper. Res. 47(2), 847\u2013877 (2022). https:\/\/doi.org\/10.1287\/moor.2021.1129","journal-title":"Math. Oper. Res."},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TCNS.2014.2357552","volume":"1","author":"S Patterson","year":"2014","unstructured":"Patterson, S., Bamieh, B.: Consensus and coherence in fractal networks. IEEE Trans. Control Netw. Syst. 1(4), 338\u2013348 (2014). https:\/\/doi.org\/10.1109\/TCNS.2014.2357552","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TCYB.2017.2781714","volume":"49","author":"Y Qi","year":"2018","unstructured":"Qi, Y., Zhang, Z., Yi, Y., Li, H.: Consensus in self-similar hierarchical graphs and sierpi\u0144ski graphs: convergence speed, delay robustness, and coherence. IEEE Trans. Cybern. 49(2), 592\u2013603 (2018). https:\/\/doi.org\/10.1109\/TCYB.2017.2781714","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"24_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/JSAC.2010.100105","volume":"28","author":"A Tizghadam","year":"2009","unstructured":"Tizghadam, A., Leon-Garcia, A.: Autonomic traffic engineering for network robustness. IEEE J. Sel. Areas Commun. 28(1), 39\u201350 (2009). https:\/\/doi.org\/10.1109\/JSAC.2010.100105","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"24_CR20","doi-asserted-by":"publisher","first-page":"2512","DOI":"10.1109\/TNET.2015.2475616","volume":"24","author":"FMF Wong","year":"2015","unstructured":"Wong, F.M.F., Liu, Z., Chiang, M.: On the efficiency of social recommender networks. IEEE\/ACM Trans. Networking 24(4), 2512\u20132524 (2015). https:\/\/doi.org\/10.1109\/TNET.2015.2475616","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"1","key":"24_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1137\/0601008","volume":"1","author":"RT Wong","year":"1980","unstructured":"Wong, R.T.: Worst-case analysis of network design problem heuristics. SIAM J. Algebraic Discrete Methods 1(1), 51\u201363 (1980). https:\/\/doi.org\/10.1137\/0601008","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"24_CR22","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/S009753979732253X","volume":"29","author":"BY Wu","year":"2000","unstructured":"Wu, B.Y., Lancia, G., Bafna, V., Chao, K.M., Ravi, R., Tang, C.Y.: A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM J. Comput. 29(3), 761\u2013778 (2000). https:\/\/doi.org\/10.1137\/S009753979732253X","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR23","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TCYB.2018.2868124","volume":"50","author":"Y Yi","year":"2018","unstructured":"Yi, Y., Zhang, Z., Patterson, S.: Scale-free loopy structure is resistant to noise in consensus dynamics in complex networks. IEEE Trans. Cybern. 50(1), 190\u2013200 (2018). https:\/\/doi.org\/10.1109\/TCYB.2018.2868124","journal-title":"IEEE Trans. Cybern."},{"key":"24_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3552644","author":"X Zhou","year":"2025","unstructured":"Zhou, X., Zehmakan, A.N., Zhang, Z.: Efficient algorithms for minimizing the kirchhoff index via adding edges. IEEE Trans. Knowl. Data Eng. (2025). https:\/\/doi.org\/10.1109\/TKDE.2025.3552644","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4839-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:38:20Z","timestamp":1767317900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}