{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:56:02Z","timestamp":1760709362043},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T00:00:00Z","timestamp":1499904000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10589-017-9924-7","type":"journal-article","created":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T10:04:55Z","timestamp":1499940295000},"page":"749-773","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Decomposition methods based on articulation vertices for degree-dependent spanning tree problems"],"prefix":"10.1007","volume":"68","author":[{"given":"Mercedes","family":"Landete","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Mar\u00edn","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Luis","family":"Sainz-Pardo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,13]]},"reference":[{"key":"9924_CR1","unstructured":"Bhatia, R., Khuller, S., Pless, R. Sussmann, Y.J.: The full degree spanning tree problem. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 864\u2013865 (1999)"},{"key":"9924_CR2","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10589-013-9556-5","volume":"56","author":"F Carrabs","year":"2013","unstructured":"Carrabs, F., Cerulli, R., Gaudioso, M., Gentili, M.: Lower and upper bounds for the spanning tree with Minimum Branch Vertices. Comput. Optim. Appl. 56, 405\u2013438 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9924_CR3","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ejor.2013.07.029","volume":"232","author":"C Cerrone","year":"2014","unstructured":"Cerrone, C., Cerulli, R., Raiconi, A.: Relations, models and a memetic approach for three degree-dependent spanning tree problems. Eur. J. Oper. Res. 232, 442\u2013453 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9924_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10589-007-9120-2","volume":"42","author":"R Cerulli","year":"2009","unstructured":"Cerulli, R., Gentili, M., Iossa, A.: Bounded-degree spanning tree problems: models and new algorithms. Comput. Optim. Appl. 42, 353\u2013370 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9924_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s00224-014-9556-6","volume":"56","author":"M Chimani","year":"2015","unstructured":"Chimani, M., Spoerhase, J.: Approximating spanning trees with few branches. Theory Comput. Syst. 56, 181\u2013196 (2015)","journal-title":"Theory Comput. Syst."},{"key":"9924_CR6","doi-asserted-by":"crossref","first-page":"3117","DOI":"10.1016\/j.cor.2008.12.009","volume":"36","author":"I Contreras","year":"2009","unstructured":"Contreras, I., Fern\u00e1ndez, E., Mar\u00edn, A.: Tight bounds from a path based formulation for the tree-of-hubs location problem. Comput. Oper. Res. 36, 3117\u20133127 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9924_CR7","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, New York (2005)","edition":"3"},{"key":"9924_CR8","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/S0377-2217(96)00327-X","volume":"104","author":"L Fernandes","year":"1998","unstructured":"Fernandes, L., Gouveia, L.: Minimal spanning trees with a constraint on the number of leaves. Eur. J. Oper. Res. 104, 250\u2013261 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9924_CR9","unstructured":"F\u00fcrer, M., Raghavachari, B.: An NC approximation algorithm for the minimum degree spanning tree problem. In: Proceedings of the 28th Annual Allerton Conference on Communication, Control and Computing, pp. 274\u2013281 (1990)"},{"key":"9924_CR10","doi-asserted-by":"crossref","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: Lecture Notes in Computer Science 2380, pp. 355\u2013365. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45465-9_31"},{"key":"9924_CR11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2013.07.023","volume":"41","author":"M Landete","year":"2014","unstructured":"Landete, M., Mar\u00edn, A.: Looking for edge-equitable spanning trees. Comput. Oper. Res. 41, 44\u201352 (2014)","journal-title":"Comput. Oper. Res."},{"key":"9924_CR12","unstructured":"Lu, H.I., Ravi, R.: The power of local optimization: approximation algorithms for maximum-leaf spanning tree. In: Proceedings of the Annual Allerton Conference on Communication Control and Computing, vol. 30, pp. 533\u2013533. University of Illinois (1992)"},{"key":"9924_CR13","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1016\/j.ejor.2015.04.011","volume":"245","author":"A Mar\u00edn","year":"2015","unstructured":"Mar\u00edn, A.: Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem. Eur. J. Oper. Res. 245, 680\u2013689 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"9924_CR14","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s00373-012-1277-5","volume":"30","author":"H Matsuda","year":"2014","unstructured":"Matsuda, H., Ozeki, K., Yamashita, T.: Spanning trees with a bounded number of branch vertices in a claw-free graph. Graphs Combin. 30, 429\u2013437 (2014)","journal-title":"Graphs Combin."},{"key":"9924_CR15","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1007\/s10589-016-9850-0","volume":"65","author":"RA Melo","year":"2016","unstructured":"Melo, R.A., Samer, P., Urrutia, S.A.: An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. Comput. Optim. Appl. 65, 821\u2013844 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"9924_CR16","unstructured":"Merabet, M., Durand, S., Molnar, M.: Minimization of branching in the optical trees with constraints on the degree of nodes. In: ICN 2012, The Eleventh International Conference on Networks, pp. 235\u2013240 (2012)"},{"key":"9924_CR17","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"SC Narula","year":"1980","unstructured":"Narula, S.C., Ho, C.A.: Degree-constrained minimum spanning tree. Comput. Oper. Res. 7, 239\u2013249 (1980)","journal-title":"Comput. Oper. Res."},{"key":"9924_CR18","unstructured":"\u00d6ncan, T.: New formulations for the Minimum Branch Vertices Problem. In: Proceedings of the World Congress on Engineering and Computer Science, San Francisco, vol. II (2014)"},{"key":"9924_CR19","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/s11081-013-9219-5","volume":"15","author":"A Rossi","year":"2014","unstructured":"Rossi, A., Singh, A., Shyam, S.: Cutting-plane-based algorithms for two branch vertices related spanning tree problems. Optim. Eng. 15, 855\u2013887 (2014)","journal-title":"Optim. Eng."},{"key":"9924_CR20","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ipl.2007.08.030","volume":"105","author":"G Salamon","year":"2008","unstructured":"Salamon, G., Wiener, G.: On finding spanning trees with few leaves. Inf. Process. Lett. 105, 164\u2013169 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9924_CR21","doi-asserted-by":"crossref","unstructured":"Silva, D.M., Silva, R.M.A., Mateus, G.R., Gon\u00e7alves, J.F., Resende, M.G.C., Festa, P.: An iterative refinement algorithm for the Minimum Branch Vertices Problem. In: Lecture Notes in Computer Science 6630, pp. 421\u2013433. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20662-7_36"},{"key":"9924_CR22","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1007\/s11590-013-0665-y","volume":"8","author":"RMA Silva","year":"2014","unstructured":"Silva, R.M.A., Silva, D.M., Resende, M.G.C., Mateus, G.R., Gon\u00e7alves, J.F., Festa, P.: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. Optim. Lett. 8, 1225\u20131243 (2014)","journal-title":"Optim. Lett."},{"key":"9924_CR23","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.cor.2016.11.010","volume":"81","author":"S Silvestri","year":"2017","unstructured":"Silvestri, S., Laporte, G., Cerulli, R.: A branch-and-cut algorithm for the Minimum Branch Vertices spanning tree problem. Comput. Oper. Res. 81, 322\u2013332 (2017)","journal-title":"Comput. Oper. Res."},{"key":"9924_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-070-4","volume-title":"The Algorithm Design Manual","author":"SS Skiena","year":"2008","unstructured":"Skiena, S.S.: The Algorithm Design Manual. Springer, New York (2008)"},{"key":"9924_CR25","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.ins.2012.01.037","volume":"195","author":"S Sundar","year":"2012","unstructured":"Sundar, S., Singh, A., Rossi, A.: New heuristics for two bounded-degree spanning tree problems. Inf. Sci. 195, 226\u2013240 (2012)","journal-title":"Inf. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9924-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9924-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9924-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:37:22Z","timestamp":1569803842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9924-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,13]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9924"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9924-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,13]]}}}