{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:15:37Z","timestamp":1726409737820},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747413"},{"type":"electronic","value":"9783540747420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74742-0_35","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:03:30Z","timestamp":1187679810000},"page":"371-382","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Share Transfer Problem on Secret Sharing Storage Systems"],"prefix":"10.1007","author":[{"given":"Toshiyuki","family":"Miyamoto","sequence":"first","affiliation":[]},{"given":"Sadatoshi","family":"Kumagai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"35_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/scj.20388","volume":"37","author":"T. Miyamoto","year":"2006","unstructured":"Miyamoto, T., Doi, S., Nogawa, H., Kumagai, S.: Autonomous Distributed Secret Sharing Storage System. Syst. & Comp. in Jpn.\u00a037(6), 55\u201363 (2006)","journal-title":"Syst. & Comp. in Jpn."},{"issue":"11","key":"35_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. communication of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"communication of the ACM"},{"key":"35_CR3","unstructured":"Kaneko, Y., Shinoda, S.: The Complexity of an Optimal File Transfer Problem. IEICE Trans. Fund.\u00a0E82-A(2) (1999)"},{"key":"35_CR4","volume-title":"Reducibility among combinatorial problems","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Plenum Press, New York (1972)"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.1996.0842","volume":"24","author":"S. Haldar","year":"1997","unstructured":"Haldar, S.: An All Pairs Shortest Paths Distributed Algorithm Using 2n\n                  2 Messages. J. of Algorithms\u00a024, 20\u201336 (1997)","journal-title":"J. of Algorithms"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0255(93)90127-8","volume":"74","author":"G.-H. Chen","year":"1993","unstructured":"Chen, G.-H., Houle, M.-E., Kuo, M.-T.: The Steiner problem in distributed computing systems. Inf. Sci.\u00a074, 73\u201396 (1993)","journal-title":"Inf. Sci."},{"issue":"2","key":"35_CR7","first-page":"299","volume":"E87-D","author":"S. Kamei","year":"2004","unstructured":"Kamei, S., Kakugawa, H.: A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem. IEICE Trans. Fund.\u00a0E87-D(2), 299\u2013307 (2004)","journal-title":"IEICE Trans. Fund."},{"key":"35_CR8","volume-title":"Graphs, Networks and Algorithms","author":"D. Jungnickel","year":"2004","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms, 2nd edn. Springer, Heidelberg (2004)","edition":"2"},{"key":"35_CR9","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"2004","unstructured":"Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2004)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica\u00a015, 141\u2013145 (1981)","journal-title":"Acta Informatica"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF00289500","volume":"23","author":"Y.F. Wu","year":"1986","unstructured":"Wu, Y.F., Widmayer, P., Wong, C.K.: A faster approximation algorithm for the Steiner problem in graphs. Acta Informatica\u00a023, 223\u2013229 (1986)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74742-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T02:50:48Z","timestamp":1550803848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74742-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540747413","9783540747420"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74742-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}