{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:45:53Z","timestamp":1725813953843},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_16","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T09:44:09Z","timestamp":1418118249000},"page":"233-247","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots"],"prefix":"10.1007","author":[{"given":"Tomoko","family":"Izumi","sequence":"first","affiliation":[]},{"given":"Sayaka","family":"Kamei","sequence":"additional","affiliation":[]},{"given":"Yukiko","family":"Yamauchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Bronnimann","year":"1995","unstructured":"Bronnimann, H., Goodrich, M.T.: Almost Optimal Set Covers in Finite VC-Dimension. Discrete & Computational Geometry\u00a014(1), 463\u2013479 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Deder, T., Greene, D.: Optimal Algorithms for Approximate Clustering. In: Proc. of STOC 1988, pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.tcs.2008.07.026","volume":"407","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary Pattern Formation by Asynchronous, Anonymous, Oblivious Robots. Theoretical Computer Science\u00a0407, 412\u2013447 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"16_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"3","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letter\u00a03(12), 133\u2013137 (1981)","journal-title":"Information Processing Letter"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17653-1_1","volume-title":"Principles of Distributed Systems","author":"N. Fujinaga","year":"2010","unstructured":"Fujinaga, N., Ono, H., Kijima, S., Yamashita, M.: Pattern Formation through Optimum Matching by Oblivious CORDA Robots. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 1\u201315. Springer, Heidelberg (2010)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-33651-5_22","volume-title":"Distributed Computing","author":"N. Fujinaga","year":"2012","unstructured":"Fujinaga, N., Yamauchi, Y., Kijima, S., Yamashita, M.: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 312\u2013325. Springer, Heidelberg (2012)"},{"key":"16_CR7","unstructured":"Franceschetti, M., Cook, M., Bruck, J.: A Geometric Theorem for Approsimate Disk Covering Algorithms, Report ETR035, Caltech (2001)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-72870-2_30","volume-title":"Algorithmic Aspects in Information and Management","author":"B. Fu","year":"2007","unstructured":"Fu, B., Chen, Z., Abdelguerfi, M.: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 317\u2013326. Springer, Heidelberg (2007)"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"T.F. Gonzalez","year":"1991","unstructured":"Gonzalez, T.F.: Covering a set of points in multidimensional space. Information Processing Letters\u00a040(4), 181\u2013188 (1991)","journal-title":"Information Processing Letters"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Mass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. Journal of the ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"Journal of the ACM"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I. Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed Anonymous Mobile Robots: Formation of geometric patterns. SIAM J. of Comput.\u00a028(4), 1347\u20131363 (1999)","journal-title":"SIAM J. of Comput."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1016\/j.tcs.2010.01.037","volume":"411","author":"M. Yamashita","year":"2010","unstructured":"Yamashita, M., Suzuki, I.: Characterizing Geometric Patterns Formable by Oblivious Anonymous Mobile Robots. Theoretical Computer Science\u00a0411, 2433\u20132453 (2010)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14472-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:07:21Z","timestamp":1559088441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}