{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:14:45Z","timestamp":1760645685440,"version":"3.37.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Sci"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10958-009-9611-z","type":"journal-article","created":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T06:33:01Z","timestamp":1251959581000},"page":"930-943","source":"Crossref","is-referenced-by-count":12,"title":["Greedy heuristics for the diameter-constrained minimum spanning tree problem"],"prefix":"10.1007","volume":"161","author":[{"given":"C.","family":"Requejo","sequence":"first","affiliation":[]},{"given":"E.","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,4]]},"reference":[{"key":"9611_CR1","doi-asserted-by":"crossref","unstructured":"A. Abdalla and N. Deo, \u201cRandom-tree diameter and the diameter-constrained MST,\u201d Int. J. Comput. Math., 79 (2002).","DOI":"10.1080\/00207160211289"},{"key":"9611_CR2","first-page":"97","volume":"136","author":"A Abdalla","year":"1999","unstructured":"A. Abdalla, N. Deo, and R. Fraceschini, \u201cParallel heuristics for the diameter-constrained minimum spanning tree,\u201d Congres. Numer., 136, 97\u2013118 (1999).","journal-title":"Congres. Numer."},{"key":"9611_CR3","first-page":"131","volume":"126","author":"A Abdalla","year":"1997","unstructured":"A. Abdalla, N. Deo, N. Kumar, and T. Terry, \u201cParallel computation of a diameter-constrained MST and related problems,\u201d Congres. Numer., 126, 131\u2013155 (1997).","journal-title":"Congres. Numer."},{"key":"9611_CR4","first-page":"261","volume":"5","author":"NR Achuthan","year":"1992","unstructured":"N. R. Achuthan and L. Caccetta, \u201cMinimum weight spanning trees with bounded diameter,\u201d Austr. J. Combin., 5, 261\u2013276 (1992).","journal-title":"Austr. J. Combin."},{"key":"9611_CR5","first-page":"51","volume":"10","author":"NR Achuthan","year":"1994","unstructured":"N. R. Achuthan, L. Caccetta, P. Caccetta, and J. F. Geelen, \u201cComputational methods for the diameter restricted minimum weight spanning tree problem,\u201d Austr. J. Combin., 10, 51\u201371 (1994).","journal-title":"Austr. J. Combin."},{"key":"9611_CR6","doi-asserted-by":"crossref","unstructured":"R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer-Verlag (2000).","DOI":"10.1007\/978-1-4419-8505-7"},{"key":"9611_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-46521-9_2","volume":"1767","author":"N Deo","year":"2000","unstructured":"N. Deo and A. Abdalla, \u201cComputing a diameter-constrained minimum spanning tree in parallel, Lect. Notes Comput. Sci., 1767, 17\u201331 (2000).","journal-title":"Lect. Notes Comput. Sci."},{"key":"9611_CR8","doi-asserted-by":"crossref","unstructured":"M. Fernandes, L. Gouveia, and S. Voss, \u201cDetermining hop-constrained spanning trees with repetitive heuristics,\u201d In: Proceedings of the INFORMS Telecom Conference, 2006.","DOI":"10.26636\/jtit.2007.4.846"},{"key":"9611_CR9","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman (1979)."},{"key":"9611_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","volume":"95","author":"L Gouveia","year":"1996","unstructured":"L. Gouveia, \u201cMulticommodity flow models for spanning trees with hop constraints,\u201d Eur. J. Oper. Res., 95, 178\u2013190 (1996).","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9611_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"L Gouveia","year":"2003","unstructured":"L. Gouveia and T. Magnanti, \u201cNetwork flow models for designing diameter-constrained minimum-spanning and Steiner trees,\u201d Networks, 41, No. 3, 159\u2013173 (2003).","journal-title":"Networks"},{"key":"9611_CR12","doi-asserted-by":"crossref","unstructured":"L. Gouveia, T. Magnanti, and C. Requejo, \u201cAn intersecting tree model for odd-diameterconstrained minimum spanning and Steiner trees,\u201d Ann. Oper. Res., 146 (2006).","DOI":"10.1007\/s10479-006-0049-0"},{"key":"9611_CR13","unstructured":"B. A. Julstrom and G. R. Raidl, \u201cA permutation-coded evolutionary algorithm for the boundeddiameter minimum spanning tree problem, In: Genetic and Evolutionary Computation Conferences Workshops Proceedings, Workshop on Analysis and Design of Representations (2003), pp. 2\u20137."},{"key":"9611_CR14","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TCOM.1976.1093334","volume":"24","author":"M Karnaugh","year":"1976","unstructured":"M. Karnaugh, \u201cA new class of algorithms for multipoint network optimization,\u201d IEEE Trans. Commun., 24, 500\u2013505 (1976).","journal-title":"IEEE Trans. Commun."},{"key":"9611_CR15","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","volume":"28","author":"A Kershenbaum","year":"1980","unstructured":"A. Kershenbaum, R. Boorstyn, and R. Oppenheim, \u201cSecond-order greedy algorithms for centralized teleprocessing network design,\u201d IEEE Trans. Commun., 28, 1835\u20131838 (1980).","journal-title":"IEEE Trans. Commun."},{"key":"9611_CR16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1009629727566","volume":"5","author":"R Patterson","year":"1999","unstructured":"R. Patterson, H. Pirkul, and E. Rolland, \u201cA memory adaptative reasoning technique for solving the capacitated minimum spanning tree problem,\u201d J. Heurist., 5, 159\u2013180 (1999).","journal-title":"J. Heurist."},{"key":"9611_CR17","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"R. Prim, \u201cShortest connection networks and some generalization,\u201d Bell Syst. Tech. J., 36, 1389\u20131401 (1957).","journal-title":"Bell Syst. Tech. J."},{"key":"9611_CR18","doi-asserted-by":"crossref","unstructured":"G. R. Raidl and B. A. Julstrom, \u201cGreedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem,\u201d In: Proceedings of the 2003 ACM Symposium on Applied Computing (2003), pp. 747\u2013752.","DOI":"10.1145\/952532.952678"},{"key":"9611_CR19","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1007\/s00500-006-0142-y","volume":"11","author":"A Singh","year":"2007","unstructured":"A. Singh and A. K. Gupta, \u201cImproved heuristics for the bounded-diameter minimum spanning tree problem,\u201d Soft Comput., 11, 911\u2013921 (2007).","journal-title":"Soft Comput."},{"issue":"3","key":"9611_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(88)90033-0","volume":"15","author":"KA Woolston","year":"1988","unstructured":"K. A. Woolston and S. L. Albin, \u201cThe design of centralized networks with reliability and availability constraints,\u201d Comput. Oper. Res., 15, No. 3, 207\u2013217 (1988).","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Mathematical Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9611-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10958-009-9611-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9611-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:38:19Z","timestamp":1739317099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10958-009-9611-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9611"],"URL":"https:\/\/doi.org\/10.1007\/s10958-009-9611-z","relation":{},"ISSN":["1072-3374","1573-8795"],"issn-type":[{"type":"print","value":"1072-3374"},{"type":"electronic","value":"1573-8795"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}