{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T12:56:29Z","timestamp":1760100989996,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11590-017-1161-6","type":"journal-article","created":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T14:52:35Z","timestamp":1497883955000},"page":"443-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On the complexity of rainbow spanning forest problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Francesco","family":"Carrabs","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6243-4512","authenticated-orcid":false,"given":"Carmine","family":"Cerrone","sequence":"additional","affiliation":[]},{"given":"Raffaele","family":"Cerulli","sequence":"additional","affiliation":[]},{"given":"Selene","family":"Silvestri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"1161_CR1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H Broersma","year":"1997","unstructured":"Broersma, H., Li, X.: Spanning trees with many or few colors in edge-colored graphs. Graph Theory 17, 259\u2013269 (1997)","journal-title":"Graph Theory"},{"key":"1161_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(00)00159-X","volume":"240","author":"RA Brualdi","year":"2001","unstructured":"Brualdi, R.A., Hollingsworth, S.: Multicolored forests in complete bipartite graphs. Discret. Math. 240, 239\u2013245 (2001)","journal-title":"Discret. Math."},{"key":"1161_CR3","unstructured":"Carr, R.D., Doddi, S., Konjedov, G., Marathe, M.: On the red-blue set cover problem. In: 11th ACN-SIAM Symposium on Discrete Algorithms, pp. 345\u2013353 (2000)"},{"key":"1161_CR4","doi-asserted-by":"crossref","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R., Silvestri, S.: The rainbow spanning forest problem. Soft. Comput. pp. 1\u201312 (2017)","DOI":"10.1007\/s11590-017-1161-6"},{"key":"1161_CR5","doi-asserted-by":"crossref","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R.: A tabu search approach for the circle packing problem. In: IEEE 2014 17th International Conference on Network-Based Information Systems, pp. 165\u2013171 (2014)","DOI":"10.1109\/NBiS.2014.28"},{"key":"1161_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.sbspro.2013.12.821","volume":"108","author":"F Carrabs","year":"2014","unstructured":"Carrabs, F., Cerulli, R., Dell\u2019Olmo, P.: A mathematical programming approach for the maximum labeled clique problem. Proc. Soc. Behav. Sci. 108, 69\u201378 (2014)","journal-title":"Proc. Soc. Behav. Sci."},{"key":"1161_CR7","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1016\/j.cor.2008.05.012","volume":"36","author":"F Carrabs","year":"2009","unstructured":"Carrabs, F., Cerulli, R., Gentili, M.: The labeled maximum matching problem. Comput. Oper. Res. 36, 1859\u20131871 (2009)","journal-title":"Comput. Oper. Res."},{"key":"1161_CR8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cor.2017.03.016","volume":"85","author":"C Cerrone","year":"2017","unstructured":"Cerrone, C., Cerulli, R., Golden, B.: Carousel greedy: a generalized greedy algorithm with applications in optimization. Comput. Oper. Res. 85, 97\u2013112 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1161_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s11590-015-0852-0","volume":"10","author":"C Cerrone","year":"2016","unstructured":"Cerrone, C., Cerulli, R., Gaudioso, M.: Omega one multi ethnic genetic approach. Optim. Lett. 10(2), 309\u2013324 (2016)","journal-title":"Optim. Lett."},{"issue":"2","key":"1161_CR10","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.ejor.2015.05.070","volume":"247","author":"C Cerrone","year":"2015","unstructured":"Cerrone, C., Cerulli, R., Gentili, M.: Vehicle-id sensor location for route flow recognition: Models and algorithms. Eur. J. Oper. Res. 247(2), 618\u2013629 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1161_CR11","first-page":"39","volume":"4","author":"R Cerulli","year":"2006","unstructured":"Cerulli, R., Fink, A., Gentili, M., Vo\u00df, S.: Extensions of the minimum labelling spanning tree problem. J. Telecommun. Inf. Technol. 4, 39\u201345 (2006)","journal-title":"J. Telecommun. Inf. Technol."},{"key":"1161_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"RS Chang","year":"1997","unstructured":"Chang, R.S., Leu, S.J.: The minimum labeling spanning trees. Inf. Process. Lett. 63, 277\u2013282 (1997)","journal-title":"Inf. Process. Lett."},{"key":"1161_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-0-387-77780-1_9","volume-title":"Telecommunications Modeling, Policy, and Technology","author":"Y Chen","year":"2008","unstructured":"Chen, Y., Cornick, N., Hall, A.O., Shajpal, R., Silberholz, J., Yahav, I., Golden, B.: Comparison of heuristics for solving the gmlst problem. In: Raghavan, S., Golden, B., Wasil, E. (eds.) Telecommunications Modeling, Policy, and Technology, pp. 191\u2013217. Springer, Berlin (2008)"},{"key":"1161_CR14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10479-008-0507-y","volume":"172","author":"S Consoli","year":"2009","unstructured":"Consoli, S., Darby-Dowman, K., Mladenovi\u0107, N., Moreno-P\u00e9rez, J.A.: Variable neighbourhood search for the minimum labelling steiner tree problem. Ann. Oper. Res. 172, 71\u201396 (2009)","journal-title":"Ann. Oper. Res."},{"key":"1161_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s11047-009-9137-9","volume":"9","author":"S Consoli","year":"2010","unstructured":"Consoli, S., Moreno-P\u00e9rez, J.A., Darby-Dowman, K., Mladenovi\u0107, N.: Discrete particle swarm optimization for the minimum labelling steiner tree problem. Nat. Comput. 9, 29\u201346 (2010)","journal-title":"Nat. Comput."},{"key":"1161_CR16","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1016\/j.cor.2011.01.011","volume":"38","author":"N Jozefowiez","year":"2011","unstructured":"Jozefowiez, N., Laporte, G., Semet, F.: A branch-and-cut algorithm for the minimum labeling hamiltonian cycle problem and two variants. Comput. Oper. Res. 38, 1534\u20131542 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1161_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/S009753979225030X","volume":"24","author":"S Kapoor","year":"1995","unstructured":"Kapoor, S., Ramesh, H.: Algorithms for enumerating all spanning trees of undirected and weighted graphs. SIAM J. Comput. 24(2), 247\u2013265 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1161_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S Krumke","year":"1998","unstructured":"Krumke, S., Wirth, H.: On the minimum label spanning tree problem. Inf. Process. Lett. 66(2), 81\u201385 (1998)","journal-title":"Inf. Process. Lett."},{"key":"1161_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2007.04.033","volume":"385","author":"X Li","year":"2007","unstructured":"Li, X., Zhang, X.Y.: On the minimum monochromatic or multicolored subgraph partition problems. Theor. Comput. Sci. 385, 1\u201310 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1161_CR20","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1002\/net.21700","volume":"68","author":"S Silvestri","year":"2016","unstructured":"Silvestri, S., Laporte, G., Cerulli, R.: The rainbow cycle cover problem. Networks 68, 260\u2013270 (2016)","journal-title":"Networks"},{"key":"1161_CR21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00373-006-0662-3","volume":"22","author":"K Suzuki","year":"2006","unstructured":"Suzuki, K.: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph. Graph Comb. 22, 261\u2013269 (2006)","journal-title":"Graph Comb."},{"key":"1161_CR22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-0-387-48793-9_8","volume-title":"Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies","author":"Y Xiong","year":"2007","unstructured":"Xiong, Y., Golden, B., Wasil, E.: The colorful traveling salesman problem. In: Baker, E.K., Joseph, A., Mehrotra, A., Trick, M.A. (eds.) Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies, pp. 115\u2013123. Springer, Berlin (2007)"},{"key":"1161_CR23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-0-387-77780-1_3","volume-title":"Telecommunications Modeling, Policy, and Technology","author":"Y Xiongm","year":"2008","unstructured":"Xiongm, Y., Golden, B., Wasil, E., Chen, S.: The label-constrained minimum spanning tree problem. In: Raghavan, S., Golden, B., Wasil, E. (eds.) Telecommunications Modeling, Policy, and Technology, pp. 39\u201358. Springer, Berlin (2008)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1161-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1161-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1161-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T04:52:26Z","timestamp":1569473546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1161-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1161"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1161-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,6,19]]}}}