{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T19:41:51Z","timestamp":1774899711484,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s42979-020-0120-y","type":"journal-article","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T19:04:46Z","timestamp":1585595086000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9573-6541","authenticated-orcid":false,"given":"V. Prem","family":"Prakash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Patvardhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"120_CR1","first-page":"153","volume":"15","author":"O Boruvka","year":"1926","unstructured":"Boruvka O. P\u0159\u00edsp\u011bvek k \u0159e\u0161en\u00ed ot\u00e1zky ekonomick\u00e9 stavby elektrovodn\u00edch s\u00edt\u00ed (Contribution to the solution of a problem of economical construction of electrical networks). Elektronick\u00fd Obzor. 1926;15:153\u20134.","journal-title":"Elektronick\u00fd Obzor"},{"issue":"6","key":"120_CR2","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC. Shortest connection networks and some generalizations. Bell Syst Tech J. 1957;36(6):1389\u2013401.","journal-title":"Bell Syst Tech J"},{"key":"120_CR3","doi-asserted-by":"crossref","unstructured":"Kruskal JB. On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the American Mathematical Society; 1956.","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"120_CR4","doi-asserted-by":"crossref","unstructured":"Raidl G, Julstrom B. Greedy heuristics and an evolutionary algorithm for the bounded diameter minimum spanning tree problem. In: ACM Symposium on Applied Computing; 2003.","DOI":"10.1145\/952532.952678"},{"key":"120_CR5","doi-asserted-by":"crossref","unstructured":"Patvardhan C, Prakash VP. Novel deterministic heuristics for the bounded diameter minimum spanning tree problem. In: Pattern Recognition and Machine Intelligence, New Delhi; 2009.","DOI":"10.1007\/978-3-642-11164-8_12"},{"key":"120_CR6","first-page":"385","volume":"14","author":"B Julstrom","year":"2004","unstructured":"Julstrom B. Codings and operators in two genetic algorithms for the leaf constrained minimum spanning tree problem. Int J Appl Math Comput Sci. 2004;14:385\u201396.","journal-title":"Int J Appl Math Comput Sci"},{"key":"120_CR7","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1016\/j.cor.2009.01.013","volume":"36","author":"P Martins","year":"2009","unstructured":"Martins P, DeSouza M. VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. Comput Oper Res. 2009;36:2969\u201382.","journal-title":"Comput Oper Res"},{"key":"120_CR8","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1109\/TEVC.2006.877147","volume":"10","author":"Y Xiong","year":"2006","unstructured":"Xiong Y, Golden B, Wasil E. Improved heuristics for the minimum label spanning tree problem. IEEE Trans Evolut Comput. 2006;10:700\u20133.","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"120_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10898-013-0124-4","volume":"60","author":"A Santos","year":"2014","unstructured":"Santos A, Lima D, Aloise D. Modeling and solving the bi-objective minimum diameter-cost spanning tree problem. J Glob Optim. 2014;60(2):195\u2013216.","journal-title":"J Glob Optim"},{"key":"120_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1051\/ro\/2014029","volume":"49","author":"E De Sousa","year":"2015","unstructured":"De Sousa E, Santos A, Aloise D. An exact method for solving the Bi-objective Minimum Diameter-Cost Spanning Tree Problem. RAIRO-Oper Res. 2015;49:143\u201360.","journal-title":"RAIRO-Oper Res"},{"key":"120_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.engappai.2019.103237","volume":"87","author":"VP Prakash","year":"2020","unstructured":"Prakash VP, Chellapilla P, Srivastav A. A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem. Eng Appl Artif Intell. 2020;87:10.","journal-title":"Eng Appl Artif Intell"},{"key":"120_CR12","unstructured":"Deo N, Micikevicius P. A heuristic for the leaf-constrained minimum spanning tree problem. In: Congressus Numerantium 141; 1999."},{"key":"120_CR13","doi-asserted-by":"crossref","unstructured":"Hoelting C, Schoenefeld D, Wainwright R. Approximation techniques for variations of the p-median problem. In: ACM Symposium on Applied Computing; 1995.","DOI":"10.1145\/315891.315997"},{"key":"120_CR14","volume-title":"Algorithmic combinatorics","author":"R Even","year":"1973","unstructured":"Even R. Algorithmic combinatorics. New York: Macmillan; 1973."},{"key":"120_CR15","unstructured":"Edelson W, Gargano M. Leaf-constrained minimal spanning trees solved by a genetic algorithm. In: Congressus Numerantium; 2002."},{"key":"120_CR16","volume-title":"How to encode a tree","author":"S Picciotto","year":"1999","unstructured":"Picciotto S. How to encode a tree. San Diego: University of California, San Diego; 1999."},{"key":"120_CR17","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1142\/S0217595908001870","volume":"25","author":"A Singh","year":"2008","unstructured":"Singh A, Baghel A. New metaheuristic approaches for the leaf-constrained Minimum Spanning Tree Problem. Asia-Pac J Oper Res. 2008;25:575\u201389.","journal-title":"Asia-Pac J Oper Res"},{"key":"120_CR18","first-page":"327","volume":"31","author":"A Singh","year":"2009","unstructured":"Singh A. An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput. 2009;31:327\u201334.","journal-title":"Appl Soft Comput"},{"key":"120_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-010-9158-x","volume":"34","author":"S Farzi","year":"2010","unstructured":"Farzi S, Dastjerdi AB. Leaf constrained minimal spanning trees solved by modified quantum-behaved particle swarm optimization. Artif Intell Rev. 2010;34:1\u201317.","journal-title":"Artif Intell Rev"},{"key":"120_CR20","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley; 1967."},{"key":"120_CR21","doi-asserted-by":"crossref","unstructured":"Patvardhan C, Prakash VP, Srivastav A. Parallel heuristics for the bounded diameter minimum spanning tree problem. In: 2014 Annual IEEE India Conference (INDICON), Pune; 2014.","DOI":"10.1109\/INDICON.2014.7030575"},{"issue":"3","key":"120_CR22","first-page":"281","volume":"39","author":"C Patvardhan","year":"2015","unstructured":"Patvardhan C, Prakash VP, Srivastav A. Fast heuristics for large instances of the Euclidean bounded diameter minimum spanning tree problem. Informatica (Slovenia). 2015;39(3):281\u201392.","journal-title":"Informatica (Slovenia)"},{"key":"120_CR23","doi-asserted-by":"crossref","unstructured":"Prakash V, Patvardhan C, Srivastav A. Effective heuristics for the bi-objective Euclidean bounded diameter minimum spanning tree problem. In: Bhattacharyya P, Sastry H, Marriboyina V, Sharma R, editors. Smart and innovative trends in next generation computing technologies. NGCT 2017. Singapore; 2018.","DOI":"10.1007\/978-981-10-8657-1_44"},{"issue":"1","key":"120_CR24","first-page":"1","volume":"14","author":"BA Julstrom","year":"2009","unstructured":"Julstrom BA. Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM J Exp Algorithmics. 2009;14(1):1\u201314.","journal-title":"ACM J Exp Algorithmics"},{"key":"120_CR25","unstructured":"DIMACS. 11th DIMACS implementation challenge in collaboration with ICERM: Steiner tree problems. http:\/\/dimacs11.zib.de\/instances\/ESMT-esteiner.zip (2014)."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-0120-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-020-0120-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-0120-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T23:19:44Z","timestamp":1617059984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-020-0120-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["120"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-0120-y","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]},"assertion":[{"value":"30 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"111"}}