{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T13:06:18Z","timestamp":1774098378994,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":5860,"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":[[1997,7]]},"DOI":"10.1016\/s0304-3975(96)00265-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"107-118","source":"Crossref","is-referenced-by-count":26,"title":["On the approximability of some maximum spanning tree problems"],"prefix":"10.1016","volume":"181","author":[{"given":"Giulia","family":"Galbiati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Morzenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00265-4_BIB1","series-title":"Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB2","unstructured":"C. Bazgan and M. Santha, Longest path in hamiltonian graphs, private communication."},{"key":"10.1016\/S0304-3975(96)00265-4_BIB3","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\/S0304-3975(96)00265-4_BIB4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(83)90014-8","article-title":"On the complexity of finding multiconstrained spanning trees","volume":"5","author":"Camerini","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(96)00265-4_BIB5","first-page":"53","article-title":"The complexity of weighted multiconstrained spanning tree problems","volume":"44","author":"Camerini","year":"1986","journal-title":"Coll. Math. Soc. Janos Bolyai"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB6","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB7","unstructured":"P. Crescenzi and V. Kann, A compendium of NP Optimization problems, Tech. Report SI\/RR-95\/02, Dipartimento di Scienze dell'Informazione, Universit\u00e9 di Roma \u201cLa Sapienza\u201d. Also available as http:\/\/www.nada.kth.se\/theory\/problemlist.html."},{"key":"10.1016\/S0304-3975(96)00265-4_BIB8","first-page":"241","article-title":"Completeness in approximation classes","volume":"2","author":"Crescenzi","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00265-4_BIB9","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BF01762131","article-title":"On finding optimal and near-optimal lineal spanning trees","volume":"3","author":"Fellows","year":"1988","journal-title":"Algorithmic"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB10","series-title":"Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"317","article-title":"Approximating the minimum degree spanning tree to within one from the optimal degree","author":"Furer","year":"1992"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","article-title":"A short note on the approximability of the maximum leaves spanning tree problem","volume":"52","author":"Galbiati","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00265-4_BIB12","series-title":"Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"223","article-title":"Improved approximation algorithms for network design problems","author":"Goemans","year":"1994"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB13","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\/S0304-3975(96)00265-4_BIB14","series-title":"Proc. 3rd Workshop on Algorithms and Data Structures","first-page":"421","article-title":"On approximating the longest path in a graph","volume":"Vol. 709","author":"Karger","year":"1993"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB15","series-title":"Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms","article-title":"Balancing minimum spanning trees and shortest-path trees","author":"Khuller","year":"1993"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB16","series-title":"Proc. 26th Annual Symp. on the Theory of Computing (STOC'94)","article-title":"Low degree spanning trees of small weight","author":"Khuller","year":"1994"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB17","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB18","series-title":"Proc. Allerton Conference","first-page":"533","article-title":"The power of local optimization: approximation algorithms for maximum-leaf spanning tree","author":"Lu","year":"1992"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB19","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0304-3975(96)00265-4_BIB20","series-title":"Proc. 25th Ann. Symp. on The Theory of Computing (STOC'94)","first-page":"438","article-title":"Many birds with one stone: multi-objective approximation algorithms","author":"Ravi","year":"1993"},{"key":"10.1016\/S0304-3975(96)00265-4_BIB21","series-title":"Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"546","article-title":"Spanning trees short or small","author":"Ravi","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002654?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002654?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:58:33Z","timestamp":1555405113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0304397596002654"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00265-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}