{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:14Z","timestamp":1725744914360},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_26","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"301-312","source":"Crossref","is-referenced-by-count":5,"title":["Secluded Connectivity Problems"],"prefix":"10.1007","author":[{"given":"Shiri","family":"Chechik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew P.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Merav","family":"Parter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC, pp. 226\u2013234 (1993)","DOI":"10.1145\/167088.167161"},{"key":"26_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern.\u00a011, 1\u201322 (1993)","journal-title":"Acta Cybern."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-72951-8_3","volume-title":"Structural Information and Communication Complexity","author":"H.L. Bodlaender","year":"2007","unstructured":"Bodlaender, H.L.: Treewidth: Structure and algorithms. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 11\u201325. Springer, Heidelberg (2007)"},{"key":"26_CR4","unstructured":"Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: SODA, pp. 345\u2013353 (2000)"},{"key":"26_CR5","unstructured":"Chechik, S., Johnson, M.P., Parter, M., Peleg, D.: Secluded Connectivity Problems, \n                  \n                    http:\/\/arxiv.org\/abs\/1212.6176"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TMC.2009.147","volume":"9","author":"A. Chen","year":"2010","unstructured":"Chen, A., Kumar, S., Lai, T.-H.: Local barrier coverage in wireless sensor networks. IEEE Tr. Mob. Comput.\u00a09, 491\u2013504 (2010)","journal-title":"IEEE Tr. Mob. Comput."},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-25011-8_30","volume-title":"Combinatorial Algorithms","author":"M. Chimani","year":"2011","unstructured":"Chimani, M., Mutzel, P., Zey, B.: Improved steiner tree algorithms for bounded treewidth. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 374\u2013386. Springer, Heidelberg (2011)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ipl.2003.11.007","volume":"89","author":"I. Dinur","year":"2004","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating label-cover. IPL\u00a089, 247\u2013254 (2004)","journal-title":"IPL"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"26_CR10","first-page":"727","volume":"76","author":"M.R. Fellows","year":"2010","unstructured":"Fellows, M.R., Guo, J., Kanj, I.A.: The parameterized complexity of some minimum label problems. JCSS\u00a076, 727\u2013740 (2010)","journal-title":"JCSS"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhao, Q., Swami, A.: The Thinnest Path Problem for Secure Communications: A Directed Hypergraph Approach. In: Proc. of the 50th Allerton Conference on Communications, Control, and Computing (2012)","DOI":"10.1109\/Allerton.2012.6483306"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM J. Appl. Math.\u00a032, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10878-007-9044-x","volume":"14","author":"R. Hassin","year":"2007","unstructured":"Hassin, R., Monnot, J., Segev, D.: Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim.\u00a014, 437\u2013453 (2007)","journal-title":"J. Comb. Optim."},{"key":"26_CR14","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":"26_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, NY (1972)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P.N. Klein","year":"1995","unstructured":"Klein, P.N., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. J. Algo.\u00a019, 104\u2013115 (1995)","journal-title":"J. Algo."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S.O. Krumke","year":"1998","unstructured":"Krumke, S.O., Wirth, H.-C.: On the minimum label spanning tree problem. IPL\u00a066, 81\u201385 (1998)","journal-title":"IPL"},{"key":"26_CR18","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"},{"key":"26_CR19","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, 759\u2013773 (2006)","journal-title":"Robotica"},{"key":"26_CR20","unstructured":"Marzouqi, M., Jarvis, R.: Robotic covert path planning: A survey. In: RAM, pp. 77\u201382 (2011)"},{"key":"26_CR21","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"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ipl.2005.06.009","volume":"96","author":"J. Monnot","year":"2005","unstructured":"Monnot, J.: The labeled perfect matching in bipartite graphs. IPL\u00a096, 81\u201388 (2005)","journal-title":"IPL"},{"key":"26_CR23","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 Algo.\u00a05, 55\u201364 (2007)","journal-title":"J. Discrete Algo."},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. ii. algorithmic aspects of tree-width. J. Algo.\u00a07, 309\u2013322 (1986)","journal-title":"J. Algo."},{"key":"26_CR25","unstructured":"Yuan, S., Varma, S., Jue, J.P.: Minimum-color path problems for reliability in mesh networks. In: INFOCOM, pp. 2658\u20132669 (2005)"},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s10878-009-9222-0","volume":"21","author":"P. Zhang","year":"2011","unstructured":"Zhang, P., Cai, J.Y., Tang, L., Zhao, W.: Approximation and hardness results for label cut and related problems. J. Comb. Optim.\u00a021, 192\u2013208 (2011)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:49:52Z","timestamp":1558025392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}