{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:00:45Z","timestamp":1778605245415,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642206610","type":"print"},{"value":"9783642206627","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_36","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"421-433","source":"Crossref","is-referenced-by-count":5,"title":["An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem"],"prefix":"10.1007","author":[{"given":"Diego M.","family":"Silva","sequence":"first","affiliation":[]},{"given":"Ricardo M. A.","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Geraldo R.","family":"Mateus","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 F.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Festa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45465-9_31","volume-title":"Automata, Languages and Programming","author":"L. Gargano","year":"2002","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 355\u2013365. Springer, Heidelberg (2002)"},{"key":"36_CR2","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-59179-2_10","volume-title":"Network Optimization","author":"N. Deo","year":"1997","unstructured":"Deo, N., Kumar, N.: Computation of Constrained Spanning Trees: A Unified Approach. In: Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0450, pp. 194\u2013220. Springer, New York (1997)"},{"key":"36_CR3","doi-asserted-by":"publisher","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.\u00a042, 353\u2013370 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"36_CR4","unstructured":"Boldon, B., Deo, N., Kumar, N.: Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. Technical Report CS-TR-95-02, Department of Computer Science, University of Central Florida, Orlando, FL (1995)"},{"key":"36_CR5","first-page":"15","volume":"123","author":"L.J. Mao","year":"1997","unstructured":"Mao, L.J., Deo, N., Lang, S.D.: A Comparison of Two Parallel Approximate Algorithms for the Degree-Constrained Minimum Spanning Tree Problem. Congressus Numerantium\u00a0123, 15\u201332 (1997)","journal-title":"Congressus Numerantium"},{"key":"36_CR6","first-page":"161","volume":"144","author":"A. Abdalla","year":"2000","unstructured":"Abdalla, A., Deo, N., Gupta, P.: Random-Tree Diameter and the Diameter Constrained MST. Congressus Numerantium\u00a0144, 161\u2013182 (2000)","journal-title":"Congressus Numerantium"},{"key":"36_CR7","first-page":"498","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 498\u2013509. MIT Press, Cambridge (2001)","edition":"2"},{"key":"36_CR8","first-page":"521","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications, pp. 521\u2013522. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"36_CR9","doi-asserted-by":"publisher","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 \u2013 A program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems. Managent Science\u00a020, 814\u2013821 (1974)","journal-title":"Managent Science"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:14:58Z","timestamp":1558574098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}