Skip to main content
Log in

Optimal Steiner trees under node and edge privacy conflicts

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this work, we suggest concepts and solution methodologies for a series of strategic network design problems that find application in highly data-sensitive industries, such as, for instance, the high-tech, governmental, or military sector. Our focus is on the installation of widely used cost-efficient tree-structured communication infrastructure. As base model we use the well-known Steiner tree problem, in which we are given terminal nodes, optional Steiner nodes, and potential network links between nodes. Its objective is to connect all terminals to a distributor node using a tree of minimum total edge costs. The novel, practically relevant side constraints are related to privacy concerns of customers, represented by terminals. In order to account for these, we study four privacy models that restrict the eligible infrastructure for the customer-distributor data exchange: (I) Selected pairs of terminals mutually exclude themselves as intermediate data-transmission nodes; (II) some pairs of terminals require disjoint paths to the distributor; (III) individual terminals forbid routing their data through allegedly untrustworthy links; and (IV) certain terminals do not allow the usage of doubtful links on their entire network branch. These topological data-privacy requirements significantly complicate the notoriously hard optimization problem. We clarify the model relationships by establishing dominance results, point out potential extensions and derive reduction tests. We present corresponding, strong non-compact integer programming (IP) formulations and embed these in efficient cutting plane methods. In addition, we develop constraint programming formulations that are used complementally to derive primal solutions. In a computational study, we analyze the performance of our methods on a diverse set of literature-based test instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. The test instances can be obtained from the authors upon request.

  2. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/steininfo.html.

  3. http://steinlib.zib.de.

References

  • Beasley JE (1989) An SST-based algorithm for the Steiner problem in graphs. Networks 19(1):1–16

    Article  MathSciNet  Google Scholar 

  • Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575–577

    Article  Google Scholar 

  • Chopra S, Gorres ER, Rao M (1992) Solving the Steiner tree problem on a graph using branch and cut. ORSA J Comput 4(3):320–335

    Article  Google Scholar 

  • Chopra S, Rao MR (1994) The Steiner tree problem I: formulations, compositions and extension of facets. Math Program 64(1–3):209–229

    Article  MathSciNet  Google Scholar 

  • Cornet A, Laforest C (2017) Total domination, connected vertex cover and Steiner tree with conflicts. Discret Math Theor Comput Sci 19(3). http://dmtcs.episciences.org/4154

  • Di Puglia Pugliese L, Gaudioso M, Guerriero F, Miglionico G (2016) An algorithm to find the link constrained Steiner tree in undirected graphs. In: Greuel GM, Koch T, Paule P, Sommese A (eds) Mathematical software: ICMS 2016. Springer International Publishing, Cham, pp 492–497

    Chapter  Google Scholar 

  • Filipecki B, Van Vyve M (2020) Stronger path-based extended formulation for the Steiner tree problem. Networks 75:3–17

    Article  MathSciNet  Google Scholar 

  • Gamrath G, Koch T, Maher SJ, Rehfeldt D, Shinano Y (2017) SCIP-Jack: a solver for STP and variants with parallelization extensions. Math Program Comput 9(2):231–296

    Article  MathSciNet  Google Scholar 

  • Hill A, Baldacci R, Voß S (2019) Branch-and-cut algorithms for Steiner tree problems with privacy conflicts. In: Computing and combinatorics, Lecture notes in computer science, vol 11653, pp 266–278. Springer International Publishing

  • Hill A, Schwarze S (2018) Exact algorithms for bi-objective ring tree problems with reliability measures. Comput Oper Res 94:38–51

    Article  MathSciNet  Google Scholar 

  • IBM CPLEX (2018) IBM ILOG CPLEX 12.90 callable library

  • Johnson DS, Minkoff M, Phillips S (2000) The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the eleventh annual ACM-SIAM symposium on discrete algorithms, pp 760–769. Society for Industrial and Applied Mathematics

  • Kanté MM, Laforest C, Momège B (2013) Trees in graphs with conflict edges or forbidden transitions. In: Chan THH, Lau LC, Trevisan L (eds) Theory and applications of models of computation. Springer, Berlin, pp 343–354

    Chapter  Google Scholar 

  • Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations, pp 85–103. Springer

  • Koch T, Martin A (1998) Solving Steiner tree problems in graphs to optimality. Networks 32(3):207–232

    Article  MathSciNet  Google Scholar 

  • Koch T, Martin A, Voß S (2001) Steinlib: an updated library on Steiner tree problems in graphs. In: Cheng XZ, Du DZ (eds) Steiner trees in industry. Springer, Boston, pp 285–325

    Chapter  Google Scholar 

  • Leggieri V, Haouari M, Triki C (2014) The Steiner tree problem with delays: a compact formulation and reduction procedures. Discret Appl Math 164:178–190

    Article  MathSciNet  Google Scholar 

  • Polzin T, Daneshmand SV (2001) A comparison of Steiner tree relaxations. Discret Appl Math 112(1):241–261

    Article  MathSciNet  Google Scholar 

  • Siebert M, Ahmed S, Nemhauser G (2018) A linear programming based approach to the Steiner tree problem with a fixed number of terminals. arXiv preprint arXiv:1812.02237

  • Una DD, Gange G, Schachte P, Stuckey PJ (2016) Steiner tree problems with side constraints using constraint programming. In: Proceedings of the thirtieth AAAI conference on Artificial Intelligence (AAAI-16), pp 3383–3389. Association for the Advancement of Artificial Intelligence

  • Vizing VG (1968) Some unsolved problems in graph theory. Russian Math Surv 23(6):125–141

    Article  MathSciNet  Google Scholar 

  • Voß S (1992) Steiner’s problem in graphs: heuristic methods. Discret Appl Math 40(1):45–72

    Article  MathSciNet  Google Scholar 

  • Voß S (1999) The Steiner tree problem with hop constraints. Ann Oper Res 86:321–345

    Article  MathSciNet  Google Scholar 

  • Wong RT (1984) A dual ascent approach for Steiner tree problems on a directed graph. Math Program 28(3):271–287

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alessandro Hill.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hill, A., Baldacci, R. & Voß, S. Optimal Steiner trees under node and edge privacy conflicts. J Comb Optim 43, 1509–1533 (2022). https://doi.org/10.1007/s10878-020-00690-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00690-1

Keywords

Navigation