{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:59:57Z","timestamp":1780358397430,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2007,8]]},"DOI":"10.1007\/s00500-006-0142-y","type":"journal-article","created":{"date-parts":[[2006,11,30]],"date-time":"2006-11-30T08:39:05Z","timestamp":1164875945000},"page":"911-921","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Improved heuristics for the bounded-diameter minimum spanning tree problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Alok","family":"Singh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashok K.","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,12,1]]},"reference":[{"key":"142_CR1","first-page":"161","volume":"144","author":"A Abdalla","year":"2000","unstructured":"Abdalla A, Deo N, Gupta P (2000) Random-tree diameter and the diameter constrained MST. Congr Numerantium 144:161\u2013182","journal-title":"Congr Numerantium"},{"key":"142_CR2","unstructured":"Achuthan NR, Caccetta L, Cacetta P, Geelen JF (1992) Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: techniques and applications, pp 297\u2013304"},{"key":"142_CR3","doi-asserted-by":"crossref","unstructured":"Bala K, Petropoulos K, Stern TE (1993) Multicasting in a linear lightwave network. In: Proceedings of IEEE INFOCOM\u201993, pp 1350\u20131358","DOI":"10.1109\/INFCOM.1993.253399"},{"key":"142_CR4","first-page":"110","volume":"16","author":"A Bookstein","year":"1996","unstructured":"Bookstein A, Klein ST (1996) Compression of correlated bit-. Inf Syst 16:110\u2013118","journal-title":"Inf Syst"},{"key":"142_CR5","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York"},{"key":"142_CR6","doi-asserted-by":"crossref","unstructured":"Deo N, Abdalla A (2000) Computing a diameter-constrained minimum spanning tree in parallel. Lecture Notes in Computer Science, vol. Springer, Berlin Heidelberg New York, pp. 17\u201331","DOI":"10.1007\/3-540-46521-9_2"},{"key":"142_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H Freeman, San Francisco"},{"key":"142_CR8","unstructured":"Goldberg DE, Lingle JR (1985) Alleles, loci, and the travelling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms, pp 154\u2013159"},{"key":"142_CR9","unstructured":"Julstrom BA, Raidl GR (2003) A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. GECCO 2003 Workshops Proceedings, Workshop on Analysis and Design of Representations, pp 2\u20137"},{"key":"142_CR10","doi-asserted-by":"crossref","unstructured":"Julstrom BA (2004a) Encoding bounded-diameter spanning trees with permutations and with random keys. Lecture Notes in Computer Science, vol 3102. Springer, Berlin Heidelberg New York, pp 1272\u20131281","DOI":"10.1007\/978-3-540-24854-5_122"},{"key":"142_CR11","unstructured":"Julstrom BA (2004b) Greedy heuristics for the bounded-diameter minimum spanning tree problem. Communicated to ACM J Exp Algorithmics"},{"key":"142_CR12","unstructured":"Kortsarz G, Peleg D (1997) Approximating shallow-light trees. In: Proceedings of the 8th Symposium on Discrete Algorithms, pp 103\u2013110"},{"key":"142_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0166-218X(99)00111-0","volume":"93","author":"G Kortsarz","year":"1999","unstructured":"Kortsarz G, Peleg D (1999) Approximating the weight of shallow Steiner trees. Discrete Appl Math 93:265\u2013285","journal-title":"Discrete Appl Math"},{"key":"142_CR14","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"Prim R (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"142_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"GR Raidl","year":"2003","unstructured":"Raidl GR, Julstrom BA (2003a) Edge-sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7:225\u2013239","journal-title":"IEEE Trans Evol Comput"},{"key":"142_CR16","doi-asserted-by":"crossref","unstructured":"Raidl GR, Julstrom BA (2003b) Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 2003 ACM Symposium on Applied Computing, pp 747\u2013752","DOI":"10.1145\/952532.952678"},{"key":"142_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond K (1989) A tree-based algorithm for distributed mutual exclusion. ACM Trans Comput Syst 7:61\u201377","journal-title":"ACM Trans Comput Syst"},{"key":"142_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5\u201313","journal-title":"Comput Oper Res"},{"key":"142_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(92)90219-L","volume":"43","author":"R Satyanarayanan","year":"1992","unstructured":"Satyanarayanan R, Muthukrishnan DR (1992) A note on Raymond\u2019s tree-based algorithm for distributed mutual exclusion. Inf Process Letters 43:249\u2013255","journal-title":"Inf Process Letters"},{"key":"142_CR20","first-page":"21","volume":"24","author":"R Satyanarayanan","year":"1994","unstructured":"Satyanarayanan R, Muthukrishnan DR (1994) A static tree-based algorithm for the distributed readers and writers problem. Comput Sci Inform 24:21\u201332","journal-title":"Comput Sci Inform"},{"key":"142_CR21","doi-asserted-by":"crossref","unstructured":"Wang S, Lang SD (1994) A tree-based distributed algorithm for the k-entry critical section problem. In: Proceedings of the 1994 International Conference on Parallel and Distributed Systems, pp 592\u2013597","DOI":"10.1109\/ICPADS.1994.590400"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0142-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-006-0142-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0142-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0142-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T17:56:17Z","timestamp":1652810177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-006-0142-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,1]]},"references-count":21,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2007,8]]}},"alternative-id":["142"],"URL":"https:\/\/doi.org\/10.1007\/s00500-006-0142-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,1]]},"assertion":[{"value":"1 December 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}