{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:59:35Z","timestamp":1774418375234,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983,1]]},"DOI":"10.1016\/0166-218x(83)90014-8","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"39-50","source":"Crossref","is-referenced-by-count":40,"title":["On the complexity of finding multi-constrained spanning trees"],"prefix":"10.1016","volume":"5","author":[{"given":"P.M.","family":"Camerini","sequence":"first","affiliation":[]},{"given":"G.","family":"Galbiati","sequence":"additional","affiliation":[]},{"given":"F.","family":"Maffioli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(83)90014-8_BIB1","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","article-title":"Complexity of spanning tree problems: Part I","volume":"5","author":"Camerini","year":"1980","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(83)90014-8_BIB2","first-page":"969","article-title":"On the complexity of Steiner-like problems","author":"Camerini","year":"1979","journal-title":"Proc. 17th Allerton Conference, IL"},{"key":"10.1016\/0166-218X(83)90014-8_BIB3","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(83)90014-8_BIB4_1","article-title":"The shortest path through a maze","author":"Moore","year":"1957","journal-title":"Proc. Int. Symp. on the Theory of Switching, Part II"},{"key":"10.1016\/0166-218X(83)90014-8_BIB4_2","first-page":"285","article-title":"The shortest path through a maze","volume":"30","author":"Moore","year":"1959"},{"key":"10.1016\/0166-218X(83)90014-8_BIB5","doi-asserted-by":"crossref","unstructured":"P.M. Camerini and G. Galbiati, The bounded path tree problem, SIAM J. Algebraic Discrete Methods, to appear.","DOI":"10.1137\/0603048"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900148?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900148?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:30:02Z","timestamp":1554813002000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X83900148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0166218X83900148"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(83)90014-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}