Skip to main content
SpringerLink
Log in

Packing trees in communication networks

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

Abstract

Given an undirected edge-capacitated graph and given (possibly) different subsets of vertices, we consider the problem of selecting a maximum (weighted) set of Steiner trees, each tree spanning a subset of vertices, without violating the capacity constraints. This problem is motivated by applications in multicast communication networks. We give an integer linear programming (ILP) formulation for the problem, and observe that its linear programming (LP) relaxation is a fractional packing problem with exponentially many variables and a block (sub-)problem that cannot be solved in polynomial time. To this end, we take an r-approximate block solver (a weak block solver) to develop a (1−ε)/r-approximation algorithm for the LP relaxation. The algorithm has a polynomial coordination complexity for any ε∈(0,1). To the best of our knowledge, this is the first approximation result for fractional packing problems with only weak block solvers (with arbitrarily large approximation ratio) and a coordination complexity that is polynomial in the input size. This leads also to an approximation algorithm for the underlying tree packing problem. Finally, we extend our results to an important multicast routing and wavelength assignment problem in optical networks, where each Steiner tree is to be assigned one of a limited set of given wavelengths, so that trees crossing the same fiber are assigned different wavelengths.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Anstreicher KM (1999) Towards a practical volumetric cutting plane method for convex programming. SIAM J Optim 9:190–206

    Article  MathSciNet  Google Scholar 

  • Arora S, Lund C, Motwani R, Sudan M, Szegedy M (1998) Proof verification and hardness of approximation problems. J Assoc Comput Mach 45:501–555

    MATH  MathSciNet  Google Scholar 

  • Arora S, Hazan E, Kale S (2008) Multiplicative weights method: a meta-algorithm and its applications. Manuscript. Available at http://www.cs.princeton.edu/~arora/pubs/MWsurvey.pdf

  • Awerbuch B, Azar Y (1995) Competitive multicast routing. Wirel Netw 1(1):107–114

    Article  Google Scholar 

  • Baltz A, Srivastav A (2004) Fast approximation of minimum multicast congestion—implementation versus theory. RAIRO Oper Res 38:319–344

    Article  MATH  MathSciNet  Google Scholar 

  • Bern M, Plassmann P (1989) The Steiner problem with edge lengths 1 and 2. Inf Process Lett 32:171–176

    Article  MATH  MathSciNet  Google Scholar 

  • Bienstock D, Iyengar G (2004) Solving fractional packing problems in O *(1/ε) iterations. In: Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), pp 146–155

  • Cai M, Deng X, Wang L (2004) Minimum k arborescences with bandwidth constraints. Algorithmica 38:529–537

    Article  MATH  MathSciNet  Google Scholar 

  • Cai Z, Lin G, Xue GL (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: Proceedings of the 11th international computing and combinatorics conference (COCOON 2005). LNCS, vol 3595. Springer, Berlin, pp 136–145

    Google Scholar 

  • Carr R, Vempala S (2000) Randomized meta-rounding. In: Proceedings of the 32nd ACM symposium on the theory of computing (STOC 2000), pp 58–62

  • Charikar M, Chekuri C, Goel A, Guha S, Plotkin S (1998) Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th annual IEEE symposium on foundations of computer science (FOCS 1998), pp 379–388

  • Chen S, Günlük O, Yener B (2000) The multicast packing problem. IEEE/ACM Trans Netw 8(3):311–318

    Article  Google Scholar 

  • Cheriyan J, Salavatipour M (2004) Hardness and approximation results for packing Steiner trees problems. In: Proceedings of the 12th annual European symposium on algorithms (ESA 2004). LNCS, vol 3221. Springer, Berlin, pp 180–191

    Google Scholar 

  • Chlebík M, Chlebíková J (2002) Approximation hardness of the Steiner tree problem. In: Proceedings of the 8th Scandinavian workshop on algorithm theory (SWAT 2002). LNCS, vol 2368. Springer, Berlin, pp 170–179

    Google Scholar 

  • Chlebíková J, Ye D, Zhang H (2006) Assign ranges in general ad-hoc networks. J Parall Distrib Comput 66(4):489–498

    Article  MATH  Google Scholar 

  • Diedrich F, Jansen K (2007) Faster and simpler approximation algorithms for mixed packing and covering problems. Theor Comput Sci 377(1–3):181–204

    Article  MATH  MathSciNet  Google Scholar 

  • Fleischer L (2000) Approximating fractional multicommodity flow independent of the number of commodities. SIAM J Discrete Math 13(4):505–520

    Article  MATH  MathSciNet  Google Scholar 

  • Garg N, Könemann J (1998) Fast and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of the 39th IEEE annual symposium on foundations of computer science (FOCS 1998), pp 300–309

  • Grigoriadis MD, Khachiyan LG (1994) Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J Optim 4:86–107

    Article  MATH  MathSciNet  Google Scholar 

  • Grigoriadis MD, Khachiyan LG (1996) Coordination complexity of parallel price-directive decomposition. Math Oper Res 2:321–340

    MathSciNet  Google Scholar 

  • Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169–197

    Article  MATH  MathSciNet  Google Scholar 

  • Grötschel M, Martin A, Weismantel R (1996a) Packing Steiner trees: a cutting plane algorithm and computational results. Math Program 72:125–145

    Article  Google Scholar 

  • Grötschel M, Martin A, Weismantel R (1996b) Packing Steiner trees: separation algorithms. SIAM J Discrete Math 9:233–257

    Article  MATH  MathSciNet  Google Scholar 

  • Grötschel M, Martin A, Weismantel R (1997) The Steiner tree packing problem in VLSI-design. Math Program 78:265–281

    Article  Google Scholar 

  • Hu X-D, Shuai T (2005) Wavelength assignment for satisfying maximal number of requests in all-optical networks. In: Proceedings of the 1st international conference on algorithmic applications in management (AAIM 2005). LNCS, vol 3521. Springer, Berlin, pp 320–329

    Google Scholar 

  • Hu X-D, Jia X, Shuai T, Zhang M-H (2004) Multicast routing and wavelength assignment in WDM networks with limited drop-offs. In: Proceedings of the 23rd annual joint conference of the IEEE computer and communications societies (INFOCOM 2004)

  • Jain K, Mahdian M, Salavatipour MR (2003) Packing Steiner trees. In: Proceedings of the 14th ACM-SIAM symposium on discrete algorithms (SODA 2003), pp 266–274

  • Jansen K (2006) Approximation algorithm for the mixed fractional packing and covering problem. SIAM J Optim 17:331–352

    Article  MATH  MathSciNet  Google Scholar 

  • Jansen K, Zhang H (2008) Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math Program, to appear. Available at http://dx.doi.org/10.1007/s10107-007-0106-8

  • Jeong GW, Lee K, Park S, Park K (2002) A branch-and-price algorithm for the Steiner tree packing problem. Comput Oper Res 29:221–241

    Article  MATH  MathSciNet  Google Scholar 

  • Jia X, Wang L (1997) A group multicast routing algorithm by using multiple minimum Steiner trees. Comput Commun 20:750–758

    Article  Google Scholar 

  • Kaski P (2004) Packing Steiner trees with identical terminal sets. Inf Process Lett 91(1):1–5

    Article  MathSciNet  MATH  Google Scholar 

  • Khandekar R (2004) Lagrangian relaxation based algorithms for convex programming problems. PhD thesis, Indian Institute of Technology Delhi

  • Lau LC (2004) An approximate max-Steiner-tree-packing min-Steiner-cut theorem. In: Proceedings of the 45th IEEE symposium on foundations of computer science (FOCS 2004), pp 61–70

  • Lau LC (2005) Packing Steiner forests. In: Proceedings of the 11th conference on integer programming and combinatorial optimization (IPCO 2005). LNCS, vol 3509. Springer, Berlin, pp 362–376

    Google Scholar 

  • Lin G (2005) An improved approximation algorithm for multicast k-tree routing. J Comb Optim 9(3):349–356

    Article  MATH  MathSciNet  Google Scholar 

  • Lu Q, Zhang H (2005) Implementation of approximation algorithms for the multicast congestion problem. In: Proceedings of the 4th international workshop on efficient and experimental algorithms (WEA 2005). LNCS, vol 3503. Springer, Berlin, pp 152–164

    Google Scholar 

  • Ma B, Wang L (2000) On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints. J Comput Syst Sci 60:1–12

    Article  MATH  MathSciNet  Google Scholar 

  • Martin A, Weismantel R (1993) Packing paths and Steiner trees: routing of electronic circuits. CWI Q 6:185–204

    MATH  MathSciNet  Google Scholar 

  • Plotkin SA, Shmoys DB, Tardos E (1995) Fast approximation algorithms for fractional packing and covering problems. Math Oper Res 2:257–301

    Article  MathSciNet  Google Scholar 

  • Raghavan P (1988) Probabilistic construction of deterministic algorithms: approximating packing integer programs. J Comput Syst Sci 37:130–143

    Article  MATH  MathSciNet  Google Scholar 

  • Pulleyblank WR (1995) Two Steiner tree packing problems. In: Proceedings of the 27th annual ACM symposium on theory of computing (STOC 1995), pp 383–387

  • Raghavan P, Thompson CD (1987) Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4):365–374

    Article  MATH  MathSciNet  Google Scholar 

  • Robins G, Zelikovsky A (2000) Improved Steiner tree approximation in graphs. In: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms (SODA 2000), pp 770–779

  • Saad M, Terlaky T, Vannelli A, Zhang H (2005) A provably good global routing algorithm in multilayer IC and MCM layout designs. Technical report, AdvOL #2005-15, Advanced Optimization Lab., McMaster University, Hamilton, ON, Canada. http://www.cas.mcmaster.ca/~oplab/research.htm

  • Sanders P, Egner S, Tolhuizen L (2003) Polynomial time algorithms for network information flow. In: Proceedings of the 15th annual ACM symposium on parallel algorithms and architectures (SPAA 2003), pp 286–294

  • Terlaky T, Vannelli A, Zhang H (2005) On routing in VLSI design and communication networks. In: Proceedings of the 16th annual international symposium on algorithms and computation (ISAAC 2005). LNCS, vol 3827. Springer, Berlin, pp 1051–1060

    Google Scholar 

  • Vannelli A (1991) An adaptation of the interior point method for solving the global routing problem. IEEE Trans Comput Aided Des 10(2):193–203

    Article  Google Scholar 

  • Vempala S, Vöcking B (1999) Approximating multicast congestion. In: Proceedings of the 10th international symposium on algorithms and computation (ISAAC 1999). LNCS, vol 1741. Springer, Berlin, pp 367–372

    Google Scholar 

  • Villavicencio J, Grigoriadis MD (1996) Approximate structured optimization by cyclic block-coordinate descent. In: Fischer H, Riedmüller B, Schäffler S (eds) Applied mathematics and parallel computing—festschrift for Klaus Ritter. Physica-Verlag, Heidelberg, pp 359–371

    Google Scholar 

  • Villavicencio J, Grigoriadis MD (1997) Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos P, Hearn DW, Hager WW (eds) Network optimization. Lecture notes in economics and mathematical systems, vol 450. Springer, Berlin, pp 471–485

    Google Scholar 

  • Vygen J (2004) Near-optimum global routing with coupling, delay bounds, and power consumption. In: Proceedings of the 10th international conference on integer programming and combinatorial optimization (IPCO 2004). LNCS, vol 3064. Springer, Berlin, pp 308–324

    Google Scholar 

  • Wang C-F, Liang C-T, Jan R-H (2002) Heuristic algorithms for packing multiple-group multicasting. Comput Oper Res 29:905–924

    Article  MATH  Google Scholar 

  • Ye D, Zhang H (2004) The range assignment problem in static ad-hoc networks on metric spaces. In: Proceedings of the 11th colloquium on structural information and communication complexity (Sirocco 2004). LNCS, vol 3104. Springer, Berlin, pp 291–302

    Google Scholar 

  • Young NE (1995) Randomized rounding without solving the linear program. In: Proceedings of the 6th ACM-SIAM symposium on discrete algorithms (SODA 1995), pp 170–178

  • Young NE (2001) Sequential and parallel algorithms for mixed packing and covering. In: Proceedings of the 42nd annual symposium on foundations of computer science (FOCS 2001), pp 538–546

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Sharjah, Sharjah, United Arab Emirates

    Mohamed Saad

  2. School of Computational Engineering and Science, Department of Computing and Software, McMaster University, Hamilton, ON, Canada

    Tamás Terlaky

  3. College of Physical and Engineering Sciences, University of Guelph, Guelph, ON, Canada

    Anthony Vannelli

  4. Canadian Imperial Bank of Commerce, Toronto, ON, Canada

    Hu Zhang

Authors
  1. Mohamed Saad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tamás Terlaky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anthony Vannelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hu Zhang.

Additional information

A preliminary version of this paper appeared in the Proceedings of the 1st Workshop on Internet and Network Economics (WINE 2005), LNCS, vol. 3828, pp. 688–697. Research supported by a MITACS grant for all the authors, an NSERC post doctoral fellowship for the first author, the NSERC Discovery Grant #5-48923 for the second and fourth author, NSERC Discovery Grant #15296 for the third author, the Canada Research Chair Program for the second author, and an NSERC industrial and development fellowship for the fourth author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Saad, M., Terlaky, T., Vannelli, A. et al. Packing trees in communication networks. J Comb Optim 16, 402–423 (2008). https://doi.org/10.1007/s10878-008-9150-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-008-9150-4

Keywords

Search

Navigation