{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:47:46Z","timestamp":1758264466021},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6347,"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":[[1996,3]]},"DOI":"10.1016\/0166-218x(95)00035-p","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"191-206","source":"Crossref","is-referenced-by-count":7,"title":["On some multicriteria arborescence problems: Complexity and algorithms"],"prefix":"10.1016","volume":"65","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00035-P_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\/0166-218X(95)00035-P_BIB2","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","article-title":"Complexity of spanning tree problems: part I, European","volume":"5","author":"Camerini","year":"1980","journal-title":"J. Oper. Res."},{"key":"10.1016\/0166-218X(95)00035-P_BIB3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(83)90014-8","article-title":"On the complexity of finding multi-constrained spanning trees","volume":"5","author":"Camerini","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00035-P_BIB4","first-page":"53","article-title":"The complexity of weighted multi-constrained spanning tree problems","volume":"44","author":"Camerini","year":"1985"},{"key":"10.1016\/0166-218X(95)00035-P_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0166-218X(95)00035-P_BIB6","first-page":"233","article-title":"Optimum branchings","volume":"71B","author":"Edmonds","year":"1967","journal-title":"J. Res. NBS"},{"key":"10.1016\/0166-218X(95)00035-P_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(95)00035-P_BIB8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0196-6774(85)90025-2","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(95)00035-P_BIB9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230090403","article-title":"A note on finding optimum branchings","volume":"9","author":"Maffioli","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0166-218X(95)00035-P_BIB10","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0166-218X(95)00035-P_BIB11","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"},{"key":"10.1016\/0166-218X(95)00035-P_BIB12","unstructured":"P. Toth, private communication, 1978."},{"key":"10.1016\/0166-218X(95)00035-P_BIB13","first-page":"663","article-title":"Multiple criteria decision making: five basic concepts","volume":"Vol. 1","author":"Yu","year":"1989"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500035P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500035P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T11:22:46Z","timestamp":1555500166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500035P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0166218X9500035P"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00035-p","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}