{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:18:54Z","timestamp":1725535134131},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_7","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T06:49:21Z","timestamp":1247208561000},"page":"56-65","source":"Crossref","is-referenced-by-count":0,"title":["Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem"],"prefix":"10.1007","author":[{"given":"Tomoko","family":"Izumi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taisuke","family":"Izumi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koichi","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms\u00a02(2), 153\u2013177 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"7_CR2","unstructured":"Arora, S., Lund, C.: Hardness of approximation. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard problems, pp. 399\u2013446. PWS publishing company (1995)"},{"issue":"1","key":"7_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":"7_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.tcs.2005.11.029","volume":"354","author":"M. Chleb\u00edk","year":"2006","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science\u00a0354(3), 320\u2013338 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","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), March 2004, pp. 616\u2013623 (2004)","DOI":"10.1109\/ICDCS.2004.1281629"},{"key":"7_CR6","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)"},{"key":"7_CR7","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), October 2001, pp. 146\u2013155 (2001)","DOI":"10.1145\/501416.501437"},{"key":"7_CR8","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)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica\u00a02(4), 385\u2013393 (1982)","journal-title":"Combinatorica"},{"key":"7_CR10","doi-asserted-by":"crossref","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)","DOI":"10.1093\/ietfec\/e88-a.5.1258"},{"key":"7_CR11","doi-asserted-by":"crossref","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)","DOI":"10.1093\/ietfec\/e89-a.2.551"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:44:55Z","timestamp":1558421095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}