{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T16:22:34Z","timestamp":1699892554044},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00420-1","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T01:10:51Z","timestamp":1045012251000},"page":"113-127","source":"Crossref","is-referenced-by-count":11,"title":["The complexity of minimizing certain cost metrics for k-source spanning trees"],"prefix":"10.1016","volume":"131","author":[{"given":"Harold S.","family":"Connamacher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00420-1_BIB1","unstructured":"E. Dahlhaus, P. Dankelmann, W. Goddard, H.C. Swart, MAD trees and distance hereditary graphs, in: Proceedings of JIM\u20192000, Metz, France, 2000, pp. 49\u201354."},{"issue":"1","key":"10.1016\/S0166-218X(02)00420-1_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1142\/S0219265900000056","article-title":"Multi-source spanning tree problems","volume":"1","author":"Farley","year":"2000","journal-title":"J. Interconnection Networks"},{"key":"10.1016\/S0166-218X(02)00420-1_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/S0166-218X(02)00420-1_BIB4","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0203015","article-title":"Optimum communication spanning trees","volume":"3","author":"Hu","year":"1974","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0166-218X(02)00420-1_BIB5","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"},{"key":"10.1016\/S0166-218X(02)00420-1_BIB6","first-page":"157","article-title":"Minimum eccentricity multicast trees","volume":"4","author":"Krumme","year":"2001","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0166-218X(02)00420-1_BIB7","unstructured":"B. McMahan, A. Proskurowski, Multi-source spanning trees: algorithms for minimizing source eccentricities, Discrete Applied Mathematics, submitted for publication."},{"issue":"2","key":"10.1016\/S0166-218X(02)00420-1_BIB8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/S0895480194266331","article-title":"Spanning trees\u2014short or small","volume":"9","author":"Ravi","year":"1996","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00420-1_BIB9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0166-218X(99)00212-7","article-title":"Approximation algorithms for some optimum communication spanning tree problems","volume":"102","author":"Wu","year":"2000","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T16:23:37Z","timestamp":1553790217000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004201"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00420-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}