{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:32:41Z","timestamp":1725478361534},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540363217"},{"type":"electronic","value":"9783540363224"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11795490_21","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T12:25:18Z","timestamp":1169555118000},"page":"261-274","source":"Crossref","is-referenced-by-count":4,"title":["Approximation Bounds for Black Hole Search Problems"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Klasing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Euripides","family":"Markou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabiano","family":"Sarracco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Csaba, B., Karpinski, M., Krysta, P.: Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. In: SODA 2002: Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 74\u201383 (2002)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11516798_5","volume-title":"Principles of Distributed Systems","author":"J. Czyzowicz","year":"2005","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Searching for a black hole in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol.\u00a03544, pp. 67\u201380. Springer, Heidelberg (2005)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fundamenta Informaticae (to appear, 2006)","DOI":"10.1007\/11516798_5"},{"key":"21_CR4","unstructured":"Dobrev, S., Flocchini, P., Kralovic, R., Prencipe, G., Ruzicka, P., Santoro, N.: Black hole search by mobile agents in hypercubes and related networks. In: Proc. 6th Int. Conf. on Principles of Distributed Systems (OPODIS 2002), pp. 169\u2013180 (2002)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45414-4_12","volume-title":"Distributed Computing","author":"S. Dobrev","year":"2001","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile agents searching for a black hole in an anonymous ring. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 166\u2013179. Springer, Heidelberg (2001)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: Optimal mobile agents protocols. In: Proc.\u00a021st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 153\u2013161 (2002)","DOI":"10.1145\/571825.571853"},{"key":"21_CR7","unstructured":"Engebretsen, L., Karpinski, M.: TSP with bounded metrics: stronger approximation hardness. Technical Report 85264, University of Bonn (February 2005)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-68671-1_6","volume-title":"Mobile Agents and Security","author":"F. Hohl","year":"1998","unstructured":"Hohl, F.: Time limited black box security: Protecting mobile agents from malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol.\u00a01419, pp. 92\u2013113. Springer, Heidelberg (1998)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Hohl, F.: A framework to protect mobile agents by using reference states. In: Proc. 20th Int. Conf. on Distributed Computing Systems (ICDCS 2000), pp. 410\u2013417 (2000)","DOI":"10.1109\/ICDCS.2000.840953"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11429647_17","volume-title":"Structural Information and Communication Complexity","author":"R. Klasing","year":"2005","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 200\u2013215. Springer, Heidelberg (2005)"},{"key":"21_CR11","unstructured":"Ng, S., Cheung, K.: Protecting mobile agents against malicious hosts by intention of spreading. In: Arabnia, H. (ed.) Proc. Int. Conf. on Parallel and Distributed Processing and Applications (PDPTA 1999), vol.\u00a0II, pp. 725\u2013729 (1999)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-68671-1_4","volume-title":"Mobile Agents and Security","author":"T. Sander","year":"1998","unstructured":"Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol.\u00a01419, pp. 44\u201360. Springer, Heidelberg (1998)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-48888-X_16","volume-title":"Intelligence in Services and Networks. Paving the Way for an Open Service Market","author":"K. Schelderup","year":"1999","unstructured":"Schelderup, K., Olnes, J.: Mobile agent security \u2013 issues and directions. In: Zuidweg, H., Campolargo, M., Delgado, J., Mullery, A. (eds.) IS&N 1999. LNCS, vol.\u00a01597, pp. 155\u2013167. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:59:43Z","timestamp":1556060383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11795490_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}