{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:15:57Z","timestamp":1742800557563},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643593"},{"type":"electronic","value":"9783540697565"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-64359-1_741","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:40:07Z","timestamp":1330299607000},"page":"770-789","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fault tolerant mobility planning for rapidly deployable wireless networks"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Charles","family":"Shields","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikas","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simeon","family":"Ntafos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Prakash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Venkatesan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"4","key":"78_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0218195995000246","volume":"5","author":"D. Crass","year":"1995","unstructured":"D. Crass, I. Suzuki, and M. Yamashita. Searching for a mobile intruder in a corridorthe open edge variant of the polygon search problem. International Journal of Computational Geometry and Applications, 5(4):397\u2013412, 1995.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"78_CR2","first-page":"149","volume":"22","author":"J. Deogun","year":"1996","unstructured":"J. Deogun and T. Sarasamma. On the Minimum Co-operative Guard Problem. Journal of Combinatorial Mathematics and Combinatorial Computing, 22:149\u2013170, 1996.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"issue":"4","key":"78_CR3","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.274999","volume":"27","author":"G. H. Forman","year":"1994","unstructured":"G. H. Forman and J. Zahorjan. The Challenges of Mobile Computing. IEEE Computer, 27(4):38\u201347, April 1994.","journal-title":"IEEE Computer"},{"issue":"1","key":"78_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1142\/S0218195996000034","volume":"6","author":"P.J. Heffernan","year":"1996","unstructured":"P.J. Heffernan. An optimal algorithm for the two-guard problem. International Journal of Computational Geometry and Applications, 6(1):15\u201344, 1996.","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"3","key":"78_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1142\/S0218195992000160","volume":"2","author":"C. Icking","year":"1992","unstructured":"C. Icking and R. Klein. The Two Guards Problem. International Journal of Computational Geometry and Applications, 2(3):257\u2013285, 1992.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"78_CR6","unstructured":"B.-C. Liaw, N.F. Huang, and R.C.T. Lee. The Minimum Cooperative Guards Problem on k-Spiral Polygons. Proceedings of the Fifth Canadian Conference on Computational Geometry, pages 97\u2013102, Aug 1993."},{"key":"78_CR7","first-page":"149","volume":"3","author":"S. Ntafos","year":"1991","unstructured":"S. Ntafos. Watchman Routes under Limited Visibility. Computational Geometry: Theory and Applications, 3:149\u2013170, 1991.","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"78_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","volume":"28","author":"S. Ntafos","year":"1988","unstructured":"S. Ntafos and C. Wei-pang. Optimum Watchman Routes. Information Processing Letters, 28(1):39\u201344, 1988.","journal-title":"Information Processing Letters"},{"key":"78_CR9","unstructured":"J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, 1987."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-64359-1_741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T14:11:48Z","timestamp":1580307108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-64359-1_741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643593","9783540697565"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-64359-1_741","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}