{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:21:51Z","timestamp":1747196511967,"version":"3.40.5"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_28","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"366-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Trees for Minimizing Average Individual Updating Cost"],"prefix":"10.1007","author":[{"given":"Sicen","family":"Guo","sequence":"first","affiliation":[]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yingchao","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/s10878-010-9312-z","volume":"22","author":"YK Chan","year":"2011","unstructured":"Chan, Y.K., Li, M., Wu, W.: Optimal tree structure with loyal users and batch updates. J. Comb. Optim. 22, 630\u2013639 (2011)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1137\/06064929X","volume":"21","author":"RL Graham","year":"2007","unstructured":"Graham, R.L., Li, M., Yao, F.F.: Optimal tree structures for group key management with batch updates. SIAM J. Disc. Math. 21(2), 532\u2013547 (2007)","journal-title":"SIAM J. Disc. Math."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Li, X.Z., Yang, Y.R., Gouda, M.G., Lam, S.S.: Batch rekeying for secure group communications. In: WWW 2001 Proceedings of the 10th International Conference on World Wide Web, pp. 525\u2013534. ACM, New York (2001)","DOI":"10.1145\/371920.372153"},{"issue":"1\u20133","key":"28_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2008.03.016","volume":"401","author":"Z-Z Chen","year":"2008","unstructured":"Chen, Z.-Z., Feng, Z., Li, M., Yao, F.F.: Optimizing deletion cost for secure multicast key management. Theor. Comput. Sci. 401(1\u20133), 52\u201361 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/j.tcs.2008.10.034","volume":"410","author":"M Li","year":"2009","unstructured":"Li, M., Feng, Z., Zang, N., Graham, R.L., Yao, F.F.: Approximately optimal trees for group key management with batch updates. Theor. Comput. Sci. 410, 1013\u20131021 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Snoeyink, J., Suri, S., Varghese, G.: A lower bound for multicast key distribution. In: Proceedings of the Twentieth Annual IEEE Conference on Computer Communications, pp. 422\u2013431 (2001)","DOI":"10.1109\/INFCOM.2001.916725"},{"issue":"4","key":"28_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/285243.285260","volume":"28","author":"CK Wong","year":"2000","unstructured":"Wong, C.K., Gouda, M.G., Lam, S.S.: Secure group communications using key graphs. ACM SIGCOMM Comput. Commun. Rev. 28(4), 68\u201379 (2000)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"2619","DOI":"10.1016\/j.tcs.2009.02.039","volume":"410","author":"W Wu","year":"2009","unstructured":"Wu, W., Li, M., Chen, E.: Optimal tree structures for group key tree management considering insertion and deletion cost. Theor. Comput. Sci. 410, 2619\u20132631 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10878-011-9431-1","volume":"26","author":"W Wu","year":"2013","unstructured":"Wu, W., Li, M., Chen, E.: Optimal key tree structure for two-user replacement and deletion problems. J. Comb. Optim. 26(1), 44\u201370 (2013)","journal-title":"J. Comb. Optim."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Yang, R.Y., Li, X.S., Zhang, X.B., Lam, S.S.: Reliable group rekeying: a performance analysis. In: ACM SIGCOMM Computer Communication Review - Proceedings of the 2001 SIGCOMM Conferrence, vol. 31, no. 4, pp. 27\u201338 (2001)","DOI":"10.1145\/964723.383062"},{"key":"28_CR11","unstructured":"Zhu, F., Chan, A., Noubir, G.: Optimal tree structure for key management of simultaneous join\/leave in secure multicast. In: Proceedings of Military Communications Conference, pp. 773\u2013778. IEEE Computer Society, Washington, DC (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T18:25:56Z","timestamp":1747160756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}