{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:21Z","timestamp":1770994101006,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540562795","type":"print"},{"value":"9783540475019","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_63","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:57:40Z","timestamp":1330235860000},"page":"106-115","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for rectilinear optimal multicast tree problem"],"prefix":"10.1007","author":[{"given":"Jan-Ming","family":"Ho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. T.","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tze-Heng","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Yi","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"12_CR1","unstructured":"H.-A. Choi and A.-H. Esfahanian (1989) \u201dThe Complexity of Optimal Distance-Preserving trees,\u201d MSU-CPS-ACS-18, Technical Report of Department of Computer Science, Michigan State University."},{"key":"12_CR2","unstructured":"H.-A. Choi, A.-H. Esfahanian and B. C. Houck (1988) \u201dOptimal Communication Trees with Application to Hypercube Multicomputer,\u201d Proceedings of the Sixth International conference on the Theory and Application of Graph Theory."},{"key":"12_CR3","first-page":"195","volume":"1","author":"S. E. Dreyer","year":"1972","unstructured":"S. E. Dreyer and R. A. Wagner, (1972) \u201dThe Steiner Problem in Graphs,\u201d Networks, vol. 1, pp. 195\u2013207.","journal-title":"Networks"},{"key":"12_CR4","unstructured":"X. Lin and L. M. Ni, (1989) \u201dSome Theoretical Results on Multicast Communications,\u201d MSU-CPS-ACS-17, Technical Report of Department of Computer Science, Michigan State University."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D. E. Knuth","year":"1971","unstructured":"D. E. Knuth, (1971) \u201dOptimal Binary Search Trees,\u201d Acta Informatica, vol. 1, pp. 14\u201325.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:48:48Z","timestamp":1619556528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}