{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:10:34Z","timestamp":1774419034913,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T00:00:00Z","timestamp":1769644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T00:00:00Z","timestamp":1769644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation","award":["2154032"],"award-info":[{"award-number":["2154032"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-026-00606-5","type":"journal-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T09:08:00Z","timestamp":1769677680000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modulus of Edge Covers and Stars"],"prefix":"10.1007","volume":"7","author":[{"given":"Adriana","family":"Ortiz-Aquino","sequence":"first","affiliation":[]},{"given":"Nathan","family":"Albin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,29]]},"reference":[{"issue":"1","key":"606_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1080\/23307706.2017.1397554","volume":"5","author":"A Agrawal","year":"2018","unstructured":"Agrawal A et al (2018) A rewriting system for convex optimization problems. J Control Decision 5(1):42\u201360","journal-title":"J Control Decision"},{"issue":"3","key":"606_CR2","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1002\/net.21945","volume":"76","author":"N Albin","year":"2020","unstructured":"Albin N, Kottegoda K, Poggi-Corradini P (2020) Spanning tree modulus for secure broadcast games. Netw 76(3):350\u2013365","journal-title":"Netw"},{"key":"606_CR3","unstructured":"Albin N, Lind J, Poggi-Corradini P (2021) \u201cConvergence of the probabilistic interpretation of modulus\u201d. arXiv:2106.11418"},{"issue":"2","key":"606_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s41478-016-0002-9","volume":"24","author":"N Albin","year":"2016","unstructured":"Albin N, Poggi-Corradini P (2016) Minimal subfamilies and the probabilistic interpretation for modulus on graphs. The J Anal 24(2):183\u2013208","journal-title":"The J Anal"},{"key":"606_CR5","unstructured":"Albin N, Poggi-Corradini P (2023) The Modulus Book. https:\/\/nathan-albin.github.io\/ modulus_book\/. Accessed: 2023-08-24"},{"issue":"13","key":"606_CR6","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1090\/ecgd\/287","volume":"19","author":"N Albin","year":"2015","unstructured":"Albin N et al (2015) Modulus on graphs as a generalization of standard graph theoretic quantities. Conform Geom Dyn American Math Soc 19(13):298\u2013317","journal-title":"Conform Geom Dyn American Math Soc"},{"key":"606_CR7","doi-asserted-by":"crossref","unstructured":"Albin N et al (2017) Modulus of families of walks on graphs. Providence, RI, Complex Anal Dyn Syst VII Amer Math Soc 35\u201355","DOI":"10.1090\/conm\/699\/14080"},{"issue":"3","key":"606_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1007\/s10231-018-0806-0","volume":"198","author":"Nathan Albin","year":"2019","unstructured":"Albin Nathan et al (2019) Blocking duality for p-modulus on networks and applications. Annali di Matematica Pura ed Applicata (1923-) 198(3):973\u2013999","journal-title":"Annali di Matematica Pura ed Applicata (1923-)"},{"issue":"5","key":"606_CR9","doi-asserted-by":"publisher","first-page":"112282","DOI":"10.1016\/j.disc.2020.112282","volume":"344","author":"Nathan Albin","year":"2021","unstructured":"Albin Nathan et al (2021) Fairest edge usage and minimum expected overlap for random spanning trees. Discrete Math 344(5):112282","journal-title":"Discrete Math"},{"issue":"83","key":"606_CR10","first-page":"1","volume":"17","author":"Steven Diamond and Stephen Boyd","year":"2016","unstructured":"Steven Diamond and Stephen Boyd (2016) CVXPY: a python-embedded modeling language for convex optimization. J Mach Learn Res 17(83):1\u20135","journal-title":"J Mach Learn Res"},{"key":"606_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449\u2013467","journal-title":"Can J Math"},{"key":"606_CR12","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) \u201cExploring network structure, dynamics, and function using NetworkX\u201d. In: Varoquaux G, Vaught T, Millman J (eds) Proceedings of the 7th python in science conference. Pasadena, CA USA, 2008, pp 11\u201315","DOI":"10.25080\/TCWV9851"},{"issue":"7825","key":"606_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"Charles R Harris","year":"2020","unstructured":"Harris Charles R et al (2020) Array programming with NumPy. Nat 585(7825):357\u2013362. https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nat"},{"key":"606_CR14","unstructured":"Kottegoda K (2020) \u201cSpanning tree modulus and secure broadcast games\u201d. PhD thesis. Kansas State University"},{"issue":"1\u20132","key":"606_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Quarterly 2(1\u20132):83\u201397","journal-title":"Naval Res Logist Quarterly"},{"key":"606_CR16","doi-asserted-by":"crossref","unstructured":"Micali S, Vazirani VV (1980) \u201cAn O ($$\\sqrt{|V|\\cdot |E|}$$) algoithm for finding maximum matching in general graphs\u201d. In: 21st Annual Symposium on Foundations of Computer Science (sfcs 1980). IEEE, pp 17\u201327","DOI":"10.1109\/SFCS.1980.12"},{"key":"606_CR17","unstructured":"Scheinerman ER, Ullman DH (2011) Fractional graph theory: a rational approach to the theory of graphs. Courier Corporation"},{"key":"606_CR18","unstructured":"Schrijver A, et al (2003) Combinatorial optimization: polyhedra and efficiency. Vol. 24. 2. Springer"},{"issue":"1","key":"606_CR19","doi-asserted-by":"publisher","first-page":"012316","DOI":"10.1103\/PhysRevE.95.012316","volume":"95","author":"H Shakeri","year":"2017","unstructured":"Shakeri H et al (2017) Network clustering and community detection using modulus of families of loops. Phys Rev E 95(1):012316","journal-title":"Phys Rev E"},{"key":"606_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen P et al (2020) SciPy 1.0: fundamental algorithms for scientific computing in python. Nat Methods 17:261\u2013272. https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nat Methods"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-026-00606-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-026-00606-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-026-00606-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:19:13Z","timestamp":1774415953000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-026-00606-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,29]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["606"],"URL":"https:\/\/doi.org\/10.1007\/s43069-026-00606-5","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,29]]},"assertion":[{"value":"26 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"20"}}