Abstract
Consider a setting where possibly sensitive information sent over a path in a network is visible to every neighbor of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a path P can be measured as the number of nodes adjacent to it, denoted by N[P]. A path is said to be secluded if its exposure is small. A similar measure can be applied to other connected subgraphs, such as Steiner trees connecting a given set of terminals. Such subgraphs may be relevant due to considerations of privacy, security or revenue maximization. This paper considers problems related to minimum exposure connectivity structures such as paths and Steiner trees. It is shown that on unweighted undirected n-node graphs, the problem of finding the minimum exposure path connecting a given pair of vertices is strongly inapproximable, i.e., hard to approximate within a factor of \(O(2^{\log ^{1-\epsilon }n})\) for any \(\epsilon >0\) (under an appropriate complexity assumption), but is approximable with ratio \(\sqrt{\Delta }+3\), where \(\Delta \) is the maximum degree in the graph. One of our main results concerns the class of bounded-degree graphs, which is shown to exhibit the following interesting dichotomy. On the one hand, the minimum exposure path problem is NP-hard on node-weighted or directed bounded-degree graphs (even when the maximum degree is 4). On the other hand, we present a polynomial algorithm (based on a nontrivial dynamic program) for the problem on unweighted undirected bounded-degree graphs. Likewise, the problem is shown to be polynomial also for the class of (weighted or unweighted) bounded-treewidth graphs. Turning to the more general problem of finding a minimum exposure Steiner tree connecting a given set of k terminals, the picture becomes more involved. In undirected unweighted graphs with unbounded degree, we present an approximation algorithm with ratio \(\min \{\Delta , n/k, \sqrt{2n},O(\log k \cdot (k+\sqrt{\Delta }))\}\). On unweighted undirected bounded-degree graphs, the problem is still polynomial when the number of terminals is fixed, but if the number of terminals is arbitrary, then the problem becomes NP-hard again.
Similar content being viewed by others
References
Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: CCC, pp. 74–80 (2009)
Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC, pp. 226–234 (1993)
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1–22 (1993)
Bodlaender, H.L.: Treewidth: structure and algorithms. In: SIROCCO, pp. 11–25 (2007)
Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: SODA, pp. 345–353 (2000)
Chen, A., Kumar, S., Lai, T.-H.: Local barrier coverage in wireless sensor networks. IEEE Tr. Mob. Comput. 9, 491–504 (2010)
Chimani, M., Mutzel, P., Zey, B.: Improved steiner tree algorithms for bounded treewidth. In: IWOCA, pp. 374–386 (2011)
Dinur, I., Safra, S.: On the hardness of approximating label-cover. IPL 89, 247–254 (2004)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634–652 (1998)
Fellows, M.R., Guo, J., Kanj, I.A.: The parameterized complexity of some minimum label problems. JCSS 76, 727–740 (2010)
Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826–834 (1977)
Hassin, R., Monnot, J., Segev, D.: Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14, 437–453 (2007)
Johansson, A., Dell’Acqua, P.: Knowledge-based probability maps for covert pathfinding. In: MIG, pp. 339–350 (2010)
Johnson, M.P., Liu, O., Rabanca, G.: Secluded path via shortest path. In: SIROCCO, pp. 108–120 (2014)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- \(\varepsilon \). J. Comput. Syst. Sci. 74, 335–349. Elsevier (2008)
Klein, P.N., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. J. Algo. 19, 104–115 (1995)
Krumke, S.O., Wirth, H.-C.: On the minimum label spanning tree problem. IPL 66, 81–85 (1998)
Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong barrier coverage of wireless sensor networks. In: MobiHoc, pp. 411–420 (2008)
Marzouqi, M., Jarvis, R.: New visibility-based path-planning approach for covert robotic navigation. Robotica 24, 759–773 (2006)
Marzouqi, M., Jarvis, R.: Robotic covert path planning: a survey. In: RAM, pp. 77–82 (2011)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: INFOCOM, pp. 1380–1387 (2001)
Monnot, J.: The labeled perfect matching in bipartite graphs. IPL 96, 81–88 (2005)
Peleg, D.: Approximation algorithms for the label-cover\(_{{\rm max}}\) and red-blue set cover problems. J. Discrete Algo. 5, 55–64 (2007)
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algo 7, 309–322 (1986)
Yuan, S., Varma, S., Jue, J.P.: Minimum-color path problems for reliability in mesh networks. In: INFOCOM, pp. 2658–2669 (2005)
Zhang, P., Cai, J.Y., Tang, L., Zhao, W.: Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21, 192–208 (2011)
Acknowledgements
We are grateful to the anonymous reviewer for the insightful and helpful comments, and in particular, for pointing out that the proof of Lemma 3.1(a) can be made gap-preserving.
Author information
Authors and Affiliations
Corresponding author
Additional information
M. Parter: Recipient of the Google Europe Fellowship in distributed computing; research supported in part by this Google Fellowship.
D. Peleg: Supported in part by the Israel Science Foundation (Grant 894/09), the United States-Israel Binational Science Foundation (Grant 2008348), the Israel Ministry of Science and Technology (infrastructures grant), and the Citi Foundation.
D. Peleg: A preliminary version of the paper has appeared in the proceedings of ESA2013.
Rights and permissions
About this article
Cite this article
Chechik, S., Johnson, M.P., Parter, M. et al. Secluded Connectivity Problems. Algorithmica 79, 708–741 (2017). https://doi.org/10.1007/s00453-016-0222-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-016-0222-z