{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:34:37Z","timestamp":1742938477918,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_51","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"548-559","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Certificate Dispersal with Tree Structures"],"prefix":"10.1007","author":[{"given":"Taisuke","family":"Izumi","sequence":"first","affiliation":[]},{"given":"Tomoko","family":"Izumi","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Koichi","family":"Wada","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"51_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The steiner problem with edge lengths 1 and 2. Information Processing Letters\u00a032(4), 171\u2013176 (1989)","journal-title":"Information Processing Letters"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved lp-based approximation for steiner tree. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 583\u2013592 (2010)","DOI":"10.1145\/1806689.1806769"},{"issue":"1","key":"51_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TMC.2003.1195151","volume":"2","author":"S. Capkun","year":"2003","unstructured":"Capkun, S., Buttyan, L., Hubaux, J.-P.: Self-organized public-key management for mobile ad hoc networks. IEEE Transactions on Mobile Computing\u00a02(1), 52\u201364 (2003)","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"3","key":"51_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2008.06.046","volume":"406","author":"M. Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: The steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science\u00a0406(3), 207\u2013214 (2008)","journal-title":"Theoretical Computer Science"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks\u00a01, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Gouda, M.G., Jung, E.: Certificate dispersal in ad-hoc networks. In: Proceeding of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), pp. 616\u2013623 (March 2004)","DOI":"10.1109\/ICDCS.2004.1281629"},{"key":"51_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/11577327_10","volume-title":"Self-Stabilizing Systems","author":"M.G. Gouda","year":"2005","unstructured":"Gouda, M.G., Jung, E.: Stabilizing Certificate Dispersal. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol.\u00a03764, pp. 140\u2013152. Springer, Heidelberg (2005)"},{"issue":"4","key":"51_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                           2.5 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Hubaux, J., Buttyan, L., Capkun, S.: The quest for security in mobile ad hoc networks. In: Proceeding of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc 2001), pp. 146\u2013155 (October 2001)","DOI":"10.1145\/501416.501437"},{"issue":"31-33","key":"51_CR10","doi-asserted-by":"publisher","first-page":"2773","DOI":"10.1016\/j.tcs.2010.03.029","volume":"411","author":"T. Izumi","year":"2010","unstructured":"Izumi, T., Izumi, T., Ono, H., Wada, K.: Approximability and inapproximability of the minimum certificate dispersal problem. Theoretical Computer Science\u00a0411(31-33), 2773\u20132783 (2010)","journal-title":"Theoretical Computer Science"},{"key":"51_CR11","unstructured":"Jagadish, H., Ooi, B., Vu, Q.: Baton: A balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 661\u2013672. VLDB Endowment (2005)"},{"key":"51_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-540-30186-8_31","volume-title":"Distributed Computing","author":"E. Jung","year":"2004","unstructured":"Jung, E., Elmallah, E.S., Gouda, M.G.: Optimal Dispersal of Certificate Chains. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 435\u2013449. Springer, Heidelberg (2004)"},{"key":"51_CR13","first-page":"116","volume":"38","author":"D. K\u00f3nig","year":"1931","unstructured":"K\u00f3nig, D.: Graphs and matrices. Matematikai \u00e9s Fizikai Lapok\u00a038, 116\u2013119 (1931) (in Hungarian)","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"51_CR14","unstructured":"Ono, H.: Reoptimization of bipartite matching (in preparation)"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Wang, S., Ooi, B., Tung, A., Xu, L.: Efficient skyline query processing on peer-to-peer networks. In: IEEE 23rd International Conference on Data Engineering, ICDE 2007, pp. 1126\u20131135. IEEE (2007)","DOI":"10.1109\/ICDE.2007.368971"},{"issue":"5","key":"51_CR16","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1093\/ietfec\/e88-a.5.1258","volume":"E88-A","author":"H. Zheng","year":"2005","unstructured":"Zheng, H., Omura, S., Uchida, J., Wada, K.: An optimal certificate dispersal algorithm for mobile ad hoc networks. IEICE Transactions on Fundamentals\u00a0E88-A(5), 1258\u20131266 (2005)","journal-title":"IEICE Transactions on Fundamentals"},{"issue":"2","key":"51_CR17","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1093\/ietfec\/e89-a.2.551","volume":"E89-A","author":"H. Zheng","year":"2006","unstructured":"Zheng, H., Omura, S., Wada, K.: An approximation algorithm for minimum certificate dispersal problems. IEICE Transactions on Fundamentals\u00a0E89-A(2), 551\u2013558 (2006)","journal-title":"IEICE Transactions on Fundamentals"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T07:57:40Z","timestamp":1675929460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}