Skip to main content
Log in

Directed Steiner trees with diffusion costs

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

Abstract

Given a directed arc-weighted graph G with n nodes, a root r and k terminals, the directed steiner tree problem (DST) consists in finding a minimum-weight tree rooted at r and spanning all the terminals. If this problem has several applications in multicast routing in packet switching networks, the modeling is not adapted anymore in networks based upon the circuit switching principle in which some nodes, called non diffusing nodes, are unable to duplicate packets. We define a more general problem, namely the directed steiner tree with a limited number of diffusing nodes (DSTLD), that enables us to model multicast in a network containing at most d diffusing nodes. We show that DSTLD is XP with respect to d, and use this result to build a \(\left\lceil \frac{k-1}{d} \right\rceil \)-approximation algorithm for DST that is XP in d. We deduce from that result a strong inapproximability property. In particular, we prove that, under the assumption that NP \(\not \subseteq \) ZTIME \([n^{\log ^{O(1)}n}]\), there is no polynomial-time approximation algorithm for DSTLD with ratio \(\varOmega \left( \frac{k}{d}\right) \). We finally give an evaluation of performances of an exact algorithm dedicated to the case \(d \le 3\).

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
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Charikar M, Chekuri C, Cheung T, Dai Z (1998) Approximation algorithms for directed Steiner problems. In: Proceedings of SODA, pp 192–200

  • Cheng X, Du D-Z (2001) Steiner trees in industry, vol 11. Kluwer, Dordrecht

    MATH  Google Scholar 

  • Ding B, Yu JX, Wang S, Qin L (2007) Finding top-k min-cost connected trees in databases. In: ICDE, pp 836–845

  • Downey R, Fellows M (1999) Parameterized complexity. Monographs in computer science. Springer, Berlin

    Book  Google Scholar 

  • Dreyfus SE, Wagner RA (1971) The Steiner problem in graphs. Networks 1(3):195–207

    Article  MathSciNet  MATH  Google Scholar 

  • Du H, Jia X, Wang F, Thai MY, Li Y (2005) A note on optical network with nonsplitting nodes. JCO 10:199–202

    MathSciNet  MATH  Google Scholar 

  • Feige U (1998) A threshold of ln n for approximating set cover. JACM 45(4):634–652

    Article  MathSciNet  MATH  Google Scholar 

  • Floyd R (1962) Algorithm 97: shortest path. Commun ACM 5(6):345

    Article  Google Scholar 

  • Gargano L, Hell P, Stacho L, Vaccaro U (2002) Spanning trees with bounded number of branch vertices. In: Proceedings of ICALP, pp 355–365

  • Guo L, Wu W, Wang F, Thai M (2005) An approximation for minimum multicast route in optical networks with nonsplitting nodes. J Comb Optim 10(4):391–394

    Article  MathSciNet  MATH  Google Scholar 

  • Halperin E, Krauthgamer R (2003) Polylogarithmic inapproximability. In Proceedings of the 35th ACM symposium on theory of computing (STOC), ACM, New York, pp 585–594

  • Helvig CS, Robins G, Zelikovsky A (2001) An improved approximation scheme for the group Steiner problem. Networks 37(1):8–20

    Article  MathSciNet  MATH  Google Scholar 

  • Jones M, Lokshtanov D, Ramanujan M, Saurabh S, Suchy O (2013) Parameterized complexity of directed Steiner tree on sparse graphs. In: Proceedings of ESA, pp 671–682

  • Karp R (1972) Reducibility among combinatorial problems. In: Complexity of computer computations. The IBM research symposia series, Springer, New York, pp 85–103

  • Koch T, Martin A, Voß S (2001) SteinLib: an updated library on Steiner tree problems in graphs. In: Combinatorial optimization, vol 11, Springer, New York, pp 285–325

  • Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Inf 15:141–145

    Article  MathSciNet  MATH  Google Scholar 

  • Lin H-c, Wang S-w (2005) Splitter placement in all-optical WDM networks. Global telecommunications conference

  • Malli R, Zhang X, Qiao C (1998) Benefit of multicasting in all-optical networks. In: Proceedings of the SPIE conference on all-optical networking

  • Novak R (2001) A note on distributed multicast routing in point-to-point networks. Comput Oper Res 28(12):1149–1164

    Article  MathSciNet  MATH  Google Scholar 

  • Reinhard V, Cohen J, Tomasik J, Barth D, Weisser M-A (2012) Optimal configuration of an optical network providing predefined multicast transmissions. Comput Netw 56(8):2097–2106

    Article  Google Scholar 

  • Reinhard V, Tomasik J, Barth D, Weisser M-A (2009) Bandwidth optimization for multicast transmissions in virtual circuit networks. IFIP networking, pp 859–870

  • Robins G, Zelikovsky A (2000) Improved Steiner tree approximation in graphs. In Proceedings of the SODA, pp 770–779

  • Rugeli J, Novak R (1995) Steiner tree algorithms for multicast protocols. Manuscript

  • Salazar-González J-J (2003) The Steiner cycle polytope. Eur J Oper Res 147(3):671–679

    Article  MathSciNet  MATH  Google Scholar 

  • Steinová M (2010) Approximability of the minimum Steiner cycle problem. Comput Inform 29:1349–1357

    MathSciNet  Google Scholar 

  • Tarjan R (1977) Finding optimum branchings. Networks 7(1):25–35

    Article  MathSciNet  MATH  Google Scholar 

  • Voß S (2006) Steiner tree problems in telecommunications. In: Handbook of optimization in telecommunications, Springer, New York, pp 459–492

  • Watel D, Weisser M, Bentz C, Barth D (2013) Steiner problems with limited number of branching nodes. In: Proceedings of SIROCCO, pp 310–321

  • Watel D, Weisser M, Bentz C, Barth D (2014) Directed Steiner tree with branching constraint. In: Proceedings of COCOON, pp 263–275

  • Zelikovsky A (1997) A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18(1):99–110

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dimitri Watel.

Additional information

This paper is an extended version of Watel et al. (2014).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Watel, D., Weisser, MA., Bentz, C. et al. Directed Steiner trees with diffusion costs. J Comb Optim 32, 1089–1106 (2016). https://doi.org/10.1007/s10878-015-9925-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9925-3

Keywords

Navigation