Secluded Connectivity Problems

  title={Secluded Connectivity Problems},
  author={Shiri Chechik and Matthew P. Johnson and Merav Parter and David Peleg},
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… CONTINUE READING


Publications citing this paper.
Showing 1-9 of 9 extracted citations

Context-Aware Social Task Resolution Using Feedback Control in Cyber Physical Systems

2018 IEEE International Conference on Communications Workshops (ICC Workshops) • 2018
View 3 Excerpts
Highly Influenced

The Thinnest Path Problem

IEEE/ACM Transactions on Networking • 2015


Publications referenced by this paper.
Showing 1-10 of 29 references

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

2009 24th Annual IEEE Conference on Computational Complexity • 2009
View 5 Excerpts
Highly Influenced

Treewidth: Structure and Algorithms

SIROCCO • 2007
View 7 Excerpts
Highly Influenced

Reducibility Among Combinatorial Problems

Complexity of Computer Computations • 1972
View 12 Excerpts
Highly Influenced

Minimum-color path problems for reliability in mesh networks

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. • 2005
View 4 Excerpts
Highly Influenced

A Threshold of ln n for Approximating Set Cover

J. ACM • 1998
View 5 Excerpts
Highly Influenced

Robotic covert path planning: A survey

2011 IEEE 5th International Conference on Robotics, Automation and Mechatronics (RAM) • 2011
View 1 Excerpt

Similar Papers

Loading similar papers…