{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:30:19Z","timestamp":1770064219996,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0304-3975(02)00888-5","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"427-437","source":"Crossref","is-referenced-by-count":19,"title":["Arborescence optimization problems solvable by Edmonds\u2019 algorithm"],"prefix":"10.1016","volume":"301","author":[{"given":"Leonidas","family":"Georgiadis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(02)00888-5_BIB1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","article-title":"The Min-Max spanning tree problem and some extensions","volume":"7","author":"Camerini","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00888-5_BIB2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230090403","article-title":"A note on finding optimum branchings","volume":"9","author":"Camerini","year":"1979","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(02)00888-5_BIB3","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"Chu","year":"1965","journal-title":"Sci. Sinica"},{"key":"10.1016\/S0304-3975(02)00888-5_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","article-title":"Optimum branchings","volume":"71B","author":"Edmonds","year":"1967","journal-title":"J. Res. Natl. Bureau Standards"},{"issue":"2","key":"10.1016\/S0304-3975(02)00888-5_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(02)00888-5_BIB6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","article-title":"Algorithms for two bottleneck optimization problems","volume":"9","author":"Gabow","year":"1988","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/S0304-3975(02)00888-5_BIB7","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/TCOM.1983.1095883","article-title":"A distributed algorithm for minimum weight directed spanning trees","volume":"31","author":"Humblet","year":"1983","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0304-3975(02)00888-5_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/net.3230010305","article-title":"A simple derivation of Edmonds\u2019 algorithm for optimum branching","volume":"1","author":"Karp","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(02)00888-5_BIB9","unstructured":"J.L. Sobrino, Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet, IEEE INFOCOM\u201901, Anchorage, Alaska, April 22\u201326, 2001."},{"key":"10.1016\/S0304-3975(02)00888-5_BIB10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","article-title":"Finding optimum branchings","volume":"7","author":"Tarjan","year":"1977","journal-title":"Networks"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008885?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008885?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T17:25:51Z","timestamp":1553966751000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0304397502008885"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00888-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}