{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:02:35Z","timestamp":1778605355642,"version":"3.51.4"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,7]],"date-time":"2007-11-07T00:00:00Z","timestamp":1194393600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10589-007-9120-2","type":"journal-article","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T20:27:49Z","timestamp":1194380869000},"page":"353-370","source":"Crossref","is-referenced-by-count":24,"title":["Bounded-degree spanning tree problems: models and new algorithms"],"prefix":"10.1007","volume":"42","author":[{"given":"R.","family":"Cerulli","sequence":"first","affiliation":[]},{"given":"M.","family":"Gentili","sequence":"additional","affiliation":[]},{"given":"A.","family":"Iossa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,7]]},"reference":[{"key":"9120_CR1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H. Broesma","year":"1997","unstructured":"Broesma, H., Li, X.: Spanning Trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory 17, 259\u2013269 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"9120_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/0-387-23529-9_7","volume-title":"The Next Wave on Computing, Optimization, and Decision Technologies","author":"R. Cerulli","year":"2005","unstructured":"Cerulli, R., Fink, A., Gentili, M., Vo\u00df, S.: Metaheuristics comparison for the minimum labelling spanning tree problem. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Next Wave on Computing, Optimization, and Decision Technologies, pp. 93\u2013106. Springer, New York (2005). [ISBN:0-387-23528-0]"},{"key":"9120_CR3","doi-asserted-by":"crossref","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: ICALP\u2019 02, Mal\u00e1ga, Spain 2002","DOI":"10.1007\/3-540-45465-9_31"},{"key":"9120_CR4","first-page":"82","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 82\u2013103. Plenum, New York (1972)"},{"key":"9120_CR5","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible algorithm for node-weighted Steiner trees. J. Algorithms 19, 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"issue":"5","key":"9120_CR6","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., Napier, A., Stutz, J.: NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manag. Sci. 20(5), 814\u2013821 (1974)","journal-title":"Manag. Sci."},{"key":"9120_CR7","first-page":"503","volume-title":"Handbooks in Operations Research and Management Science","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees, network models. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operations Research and Management Science, vol.\u00a07, pp.\u00a0503\u2013615. North-Holland, Amsterdam (1995)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9120-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9120-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9120-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:33Z","timestamp":1559302593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9120-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,7]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9120"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9120-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,7]]}}}