{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T19:41:52Z","timestamp":1774899712474,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642111631","type":"print"},{"value":"9783642111648","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11164-8_12","type":"book-chapter","created":{"date-parts":[[2009,12,14]],"date-time":"2009-12-14T22:15:37Z","timestamp":1260828937000},"page":"68-73","source":"Crossref","is-referenced-by-count":6,"title":["Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter"],"prefix":"10.1007","author":[{"given":"C.","family":"Patvardhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Prem","family":"Prakash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Abdalla, A., Deo, N., Gupta, P.: Random-tree Diameter and the diameter constrained MST. In: Congressus Numerantium, vol.\u00a0144, pp. 161\u2013182. Utilitas Mathematica (2000)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bala, K., Petropoulos, K., Stern, T.E.: Multicasting in a linear lightwave network. In: IEEE INFOCOM 1993, pp. 1350\u20131358 (1993)","DOI":"10.1109\/INFCOM.1993.253399"},{"issue":"4","key":"12_CR3","first-page":"110","volume":"16","author":"A. Bookstein","year":"1996","unstructured":"Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Information Systems\u00a016(4), 110\u2013118 (1996)","journal-title":"Information Systems"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems\u00a07(1), 61\u201377 (1989)","journal-title":"ACM Transactions on Computer Systems"},{"key":"12_CR5","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"12_CR6","unstructured":"Kortsarz, G., Peleg, D.: Approximating shallow-light trees. In: Proc. Eighth ACM-SIAM Symposium on Discrete Algorithms, pp. 103\u2013110 (1997)"},{"key":"12_CR7","unstructured":"Julstrom, B.A., Raidl, G.R.: A permutation-coded EA for the BDMST problem. In: GECCO 2003 Workshops Proc., Workshop on Analysis & Design of Representations, pp. 2\u20137 (2003)"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A.: Greedy Heuristics for the Bounded Diameter Minimum Spanning Tree Problem. ACM J. Exp. Algor.\u00a014, Article 1.1 (2009)","DOI":"10.1145\/1498698.1498699"},{"key":"12_CR10","unstructured":"Achuthan, N.R., Caccetta, L., Cacetta, P., Geelen, J.F.: Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: Techniques and Applications, 297\u2013304 (1992)"},{"issue":"10","key":"12_CR11","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s00500-006-0142-y","volume":"11","author":"A. Singh","year":"2007","unstructured":"Singh, A., Gupta, A.K.: Improved heuristics for the bounded diameter minimum spanning tree problem. Soft Computing\u00a011(10), 911\u2013921 (2007)","journal-title":"Soft Computing"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11164-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:38:00Z","timestamp":1606185480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11164-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642111631","9783642111648"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11164-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}