{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:57Z","timestamp":1725663717135},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540538325"},{"type":"electronic","value":"9783540463108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53832-1_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:13:31Z","timestamp":1330208011000},"page":"170-181","source":"Crossref","is-referenced-by-count":2,"title":["On complexity of a message-routing strategy for multicomputer systems"],"prefix":"10.1007","author":[{"given":"Hyeong-Ah","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdol-Hossein","family":"Esfahanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"15_CR1","unstructured":"H.-A. Choi, A.-H. Esfahanian, and B. Houck, \"Optimal Communication Trees with Application to Hypercube Multicomputers,\" Proc. 6th Intl. Conf. Theory and Applications of Graph Theory, Kalamazoo, MI, 1988."},{"key":"15_CR2","volume-title":"Computer and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D.S. Johnson, Computer and Intractability, W.H. Freeman and Company, San Francisco, 1979."},{"key":"15_CR3","unstructured":"Y. Lan, L.M. Ni, and A.-H. Esfahanian, \"Relay Approach Message Routing in Hypercube Multiprocessors,\" Proceedings of the 3rd International Conference on Supercomputing, pp. 174\u2013183, May 1988."},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T. Wong, \"A Dual Ascent Approach for Steiner Tree Problems on Directed Graphs,\" Mathematical Programming, Vol. 28, pp. 271\u2013287, 1984.","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53832-1_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:16:14Z","timestamp":1619572574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53832-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540538325","9783540463108"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-53832-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}