{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:06:23Z","timestamp":1746331583879,"version":"3.40.4"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096193"},{"type":"electronic","value":"9783319096209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09620-9_10","type":"book-chapter","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T02:07:37Z","timestamp":1405476457000},"page":"108-120","source":"Crossref","is-referenced-by-count":2,"title":["Secluded Path via Shortest Path"],"prefix":"10.1007","author":[{"given":"Matthew P.","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Ou","family":"Liu","sequence":"additional","affiliation":[]},{"given":"George","family":"Rabanca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: SODA, pp. 345\u2013353 (2000)"},{"issue":"1-3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0898-1221(89)90156-9","volume":"17","author":"D. Chavey","year":"1989","unstructured":"Chavey, D.: Tilings by regular polygons: A catalog of tilings. Computers & Mathematics with Applications\u00a017(1-3), 147\u2013165 (1989)","journal-title":"Computers & Mathematics with Applications"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-40450-4_26","volume-title":"Algorithms \u2013 ESA 2013","author":"S. Chechik","year":"2013","unstructured":"Chechik, S., Johnson, M.P., Parter, M., Peleg, D.: Secluded connectivity problems. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 301\u2013312. Springer, Heidelberg (2013)"},{"issue":"49","key":"10_CR4","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen\u00a049(49), 758\u2013764 (1946)","journal-title":"Koninklijke Nederlandse Akademie v. Wetenschappen"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhao, Q., Swami, A.: The thinnest path problem for secure communications: A directed hypergraph approach. In: Allerton Conference on Communications, Control, and Computing (2012)","DOI":"10.1109\/Allerton.2012.6483306"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhao, Q., Swami, A.: The thinnest path problem for secure communications: A directed hypergraph approach. In: Allerton Conference on Communication, Control, and Computing, pp. 847\u2013852 (2012)","DOI":"10.1109\/Allerton.2012.6483306"},{"key":"10_CR7","unstructured":"Grunbaum, B., Shephard, G.C.: Tilings and Patterns. W. H. Freeman and Company (1987)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-16958-8_32","volume-title":"Motion in Games","author":"A. Johansson","year":"2010","unstructured":"Johansson, A., Dell\u2019Acqua, P.: Knowledge-based probability maps for covert pathfinding. In: Boulic, R., Chrysanthou, Y., Komura, T. (eds.) MIG 2010. LNCS, vol.\u00a06459, pp. 339\u2013350. Springer, Heidelberg (2010)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong barrier coverage of wireless sensor networks. In: MobiHoc, pp. 411\u2013420 (2008)","DOI":"10.1145\/1374618.1374673"},{"issue":"6","key":"10_CR10","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1017\/S0263574706002931","volume":"24","author":"M. Marzouqi","year":"2006","unstructured":"Marzouqi, M., Jarvis, R.: New visibility-based path-planning approach for covert robotic navigation. Robotica\u00a024(6), 759\u2013773 (2006)","journal-title":"Robotica"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Marzouqi, M.A., Jarvis, R.A.: Robotic covert path planning: A survey. In: RAM, pp. 77\u201382 (2011)","DOI":"10.1109\/RAMECH.2011.6070460"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: INFOCOM, pp. 1380\u20131387 (2001)","DOI":"10.1145\/381677.381691"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jda.2006.03.008","volume":"5","author":"D. Peleg","year":"2007","unstructured":"Peleg, D.: Approximation algorithms for the label-covermax and red-blue set cover problems. J. Discrete Algorithms\u00a05(1), 55\u201364 (2007)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09620-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T20:39:57Z","timestamp":1746304797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09620-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096193","9783319096209"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09620-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}