{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:52:03Z","timestamp":1773273123081,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":3521,"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":[[2004,1]]},"DOI":"10.1016\/s0166-218x(03)00340-8","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T22:28:16Z","timestamp":1059690496000},"page":"51-65","source":"Crossref","is-referenced-by-count":18,"title":["On the complexity of graph tree partition problems"],"prefix":"10.1016","volume":"134","author":[{"given":"Roberto","family":"Cordone","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\/S0166-218X(03)00340-8_BIB1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BF01459088","article-title":"Zum Hilbertschen Aufban der Reelen Zahlen","volume":"99","author":"Ackermann","year":"1928","journal-title":"Math. Ann."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB2","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1002\/net.3230210605","article-title":"Balanced spanning forests and trees","volume":"21","author":"Ali","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00340-8_BIB3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","article-title":"Heuristics with constant error guarantees for the design of tree networks","volume":"32","author":"Altinkemer","year":"1988","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB4","series-title":"Graphes","author":"Berge","year":"1983"},{"key":"10.1016\/S0166-218X(03)00340-8_BIB5","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB6","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/S0166-218X(03)00340-8_BIB7","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","article-title":"A general approximation technique for constrained forest problems","volume":"24","author":"Goemans","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2346439","article-title":"Minimum spanning trees and single linkage cluster analysis","volume":"18","author":"Gower","year":"1969","journal-title":"Appl. Statist."},{"issue":"2","key":"10.1016\/S0166-218X(03)00340-8_BIB9","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/jagm.1996.0848","article-title":"Approximation algorithms for min\u2013max tree partition","volume":"24","author":"Guttmann-Beck","year":"1997","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"10.1016\/S0166-218X(03)00340-8_BIB10","first-page":"117","article-title":"Approximation algorithms for minimum tree partition","volume":"87","author":"Guttmann-Beck","year":"1998","journal-title":"Appl. Math."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6377(93)90097-Z","article-title":"A greedy heuristic for a minimum weight forest problem","volume":"14","author":"Imieli\u0144ska","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","article-title":"The complexity of the capacitated tree problem","volume":"8","author":"Papadimitriou","year":"1978","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00340-8_BIB15","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/S0166-218X(03)00340-8_BIB16","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/0377-2217(94)00335-1","article-title":"A heuristic algorithm for the mini\u2013max spanning forest problem","volume":"91","author":"Yamada","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00340-8_BIB17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0377-2217(96)00155-5","article-title":"A branch-and-bound algorithm for the mini\u2013max spanning forest problem","volume":"93","author":"Yamada","year":"1997","journal-title":"European J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003408?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003408?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T07:58:46Z","timestamp":1552809526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0166218X03003408"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00340-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}