Advertisement

Dominating an s-t-Cut in a Network

  • Ralf Rothenberger
  • Sascha Grau
  • Michael Rossberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8939)

Abstract

We study an optimization problem with applications in design and analysis of resilient communication networks: given two vertices s, t in a graph G = (V,E), find a vertex set X ⊂ V of minimum cardinality, such that X and its neighborhood constitute an s-t vertex separator. Although the problem naturally combines notions of graph connectivity and domination, its computational properties significantly differ from these relatives.

In particular, we show that on general graphs the problem cannot be approximated to within a factor of \(2^{\log^{1-\delta}{n}}\), with δ = 1 / loglog c n and arbitrary \(c<\frac{1}{2}\) (if P ≠ NP). This inapproximability result even applies if the subgraph induced by a solution set has the additional constraint of being connected. Furthermore, we give a \(2\sqrt{n}\)-approximation algorithm and study the problem on graphs with bounded node degree. With Δ being the maximum degree of nodes V ∖ {s,t}, we identify a (Δ + 1) approximation algorithm.

Keywords

graph theory approximation algorithms inapproximability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bollapragada, V., Khalid, M., Wainner, S.: IPSec VPN Design. Cisco Press (2005)Google Scholar
  2. 2.
    Vasserman, E., Jansen, R., Tyra, J., Hopper, N., Kim, Y.: Membership-concealing overlay networks. In: 16th ACM CCS, pp. 390–399. ACM (2009)Google Scholar
  3. 3.
    Clarke, I., Sandberg, O., Toseland, M., Verendel, V.: Private communication through a network of trusted connections: The dark freenet. Network (2010)Google Scholar
  4. 4.
    Rossberg, M., Girlich, F., Schaefer, G.: Analyzing and Improving the Resistance of Overlays against Bandwidth Exhaustion Attacks. In: International Workshop on Reliable Networks Design and Modeling (RNDM) (2012)Google Scholar
  5. 5.
    Girlich, F., Rossberg, M., Schaefer, G.: On the Resistance of Overlay Networks against Bandwidth Exhaustion Attacks. Accepted for Telecommunication Systems Journal (Special Issue) (2014)Google Scholar
  6. 6.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River (1993)zbMATHGoogle Scholar
  7. 7.
    Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 345–353 (2000)Google Scholar
  8. 8.
    Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2(2), 153–177 (2006)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Peleg, D.: Approximation algorithms for the label-covermax and red-blue set cover problems. Journal of Discrete Algorithms 5(1), 55–64 (2007)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Ralf Rothenberger
    • 1
  • Sascha Grau
    • 2
  • Michael Rossberg
    • 2
  1. 1.Friedrich-Schiller-Universität JenaJenaGermany
  2. 2.Technische Universität IlmenauIlmenauGermany

Personalised recommendations