Skip to main content
SpringerLink
Log in

Approximation algorithms for general packing problems and their application to the multicast congestion problem

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we present approximation algorithms based on a Lagrangian decomposition via a logarithmic potential reduction to solve a general packing or min–max resource sharing problem with M non-negative convex constraints on a convex set B. We generalize a method by Grigoriadis et al. to the case with weak approximate block solvers (i.e., with only constant, logarithmic or even worse approximation ratios). Given an accuracy \(\varepsilon \in (0,1)\), we show that our algorithm needs \(O(M(ln M+ \varepsilon^{-2} ln \varepsilon^{-1}))\) calls to the block solver, a bound independent of the data and the approximation ratio of the block solver. For small approximation ratios the algorithm needs \(O(M(ln M + \varepsilon^{-2}))\) calls to the block solver. As an application we study the problem of minimizing the maximum edge congestion in a multicast communication network. Interestingly the block problem here is the classical Steiner tree problem that can be solved only approximately. We show how to use approximation algorithms for the Steiner tree problem to solve the multicast congestion problem approximately.

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

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

    MATH  MathSciNet  Google Scholar 

  2. Baltz, A., Srivastav, A.: Fast approximation of multicast congestion, Manuscript (2001)

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Burden R.L. and Faires J.D. (1997). Numerical analysis, 6th edn. Brooks/Cole publishing company, Baltimore/Three Lakes

    Google Scholar 

  6. Carr, R., Vempala, S.: Randomized meta-rounding. In: Proceedings of the 32nd ACM Symposium on the Theory of Computing, STOC, pp 58–62 (2000)

  7. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: 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, pp 379–388(1998)

  8. Chlebí k, M., Chlebí ková, J.: Approximation hardness of the Steiner tree problem. In: Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT, LNCS, vol. 2368, pp 170–179 (2002)

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

    Article  Google Scholar 

  10. Even G., Naor J.S., Rao S. and Schieber B. (1999). Fast approximate graph partitioning algorithms. SIAM J. Comput. 6: 2187–2214

    Article  MathSciNet  Google Scholar 

  11. Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp 994–1003 (2004)

  12. Garg, N., Khandekar, R.: Fractional covering with upper bounds on the variables: solving LPs with negative entries. In: Proceedings of the 12th Annual European Symposium on Algorithms, ESA, LNCS, vol. 3221, pp 371–382 (2004)

  13. Garg, N., Könemann, J.: 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, pp 300–309 (1998)

  14. Grigoriadis M.D. and Khachiyan L.G. (1994). Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4: 86–107

    Article  MATH  MathSciNet  Google Scholar 

  15. Grigoriadis M.D. and Khachiyan L.G. (1996). Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 2: 321–340

    MathSciNet  Google Scholar 

  16. Grigoriadis M.D. and Khachiyan L.G. (1996). Approximate minimum-cost multicommodity flows in O(ε−2 knm) time. Math. Programm. 75: 477–482

    MathSciNet  Google Scholar 

  17. Grigoriadis M.D., Khachiyan L.G., Porkolab L. and Villavicencio J. (2001). Approximate max–min resource sharing for structured concave optimization. SIAM J. Optim. 11: 1081–1091

    Article  MATH  MathSciNet  Google Scholar 

  18. Grötschel M., Lovász L. and Schrijver A. (1988). Geometric Algorithms and Combinatorial Optimization. Springer, Berlin

    MATH  Google Scholar 

  19. Jansen K. (2003). Approximate strong separation with application in fractional graph coloring and preemptive scheduling. Theor. Comput. Sci. 302: 239–256

    Article  MATH  MathSciNet  Google Scholar 

  20. Jansen K. (2006). An approximation algorithm for the general max–min resource sharing problem. Math. 106(3): 547–566

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. Diedrich, F., Jansen, K., Faster and simpler approximation algorithms for mixed packing and covering problems, to appear in Theoretical Computer Science.

  23. Jansen K. and Porkolab L. (2001). Improved approximation schemes for scheduling unrelated parallel machines. Math. Oper. Res. 26: 324–338

    Article  MATH  MathSciNet  Google Scholar 

  24. Jansen K. and Porkolab L. (2006). On preemptive resource constrained scheduling: polynomial time schemes. SIAM. J. Discrete. Math. 20: 545–563

    Article  MATH  MathSciNet  Google Scholar 

  25. Jansen K. and Solis-Oba R. (2003). An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. 306: 543–551

    Article  MATH  MathSciNet  Google Scholar 

  26. Karp R.M. (1972). Reducibility among combinatorial problems. In: Miller, R.E. and Thatcher, J.W. (eds) Complexity of Computer Computations, pp 85–103. Plenum Press, New York

    Google Scholar 

  27. Klein P., Plotkin S., Stein C. and Tardos E. (1994). Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM J. Comput. 23: 466–487

    Article  MATH  MathSciNet  Google Scholar 

  28. Lenstra J.K., Shmoys D.B. and Tardos E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 24: 259–272

    Article  MathSciNet  Google Scholar 

  29. Lu, Q., Zhang, H.: Implementation of approximation algorithms for the multicast congestion problem. In: Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms, WEA, LNCS, vol. 3503, pp 152–164 (2005)

  30. Plotkin S.A., Shmoys D.B. and Tardos E. (1995). Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 2: 257–301

    Article  MathSciNet  Google Scholar 

  31. Radzik T. (1997). Fast deterministic approximation for the multicommodity flow problem. Math. Program. 78: 43–58

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  34. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp 770–779 (2000)

  35. Terlaky, T., Vannelli, A., Zhang, H.: On routing in VLSI design and communication networks. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation, ISAAC, LNCS, vol. 3827, pp 1051–1060 (2005)

  36. Vempala, S., Vöcking, B.: Approximating multicast congestion. In: Proceedings of the tenth International Symposium on Algorithms and Computation, ISAAC, LNCS, vol. 1741, pp 367–372 (1999)

  37. Villavicencio J. and Grigoriadis M.D. (1996). Approximate structured optimization by cyclic block-coordinate descent. In: Ritter, K., Fischer, H., Riedmüller, B. and Schäffler, S. (eds) Applied Mathematics and Parallel Computing—Festschrift, pp 359–371. Physica-Verlag, Heidelberg

    Google Scholar 

  38. Villavicencio J. and Grigoriadis M.D. (1997). Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W. and Hager, W.W. (eds) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 450, pp 471–485. Springer, Berlin

    Google Scholar 

  39. Ye, D., Zhang, H.: 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, LNCS, vol. 3104, pp 291–302 (2004)

  40. Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp 170–178 (1995)

  41. Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, FOCS, pp 538–546 (2001)

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Kiel, Olshausenstraße 40, 24098, Kiel, Germany

    Klaus Jansen

  2. Department of Computing and Software, McMaster University, 1280 Main Street West, Hamilton, ON, L8S 4K1, Canada

    Hu Zhang

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hu Zhang.

Additional information

This work was done in part when the second author was studying at the University of Kiel.

This paper combines our extended abstracts of the 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, Montréal, Canada and the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, ARACNE 2002, Roma, Italy. This research was supported in part by the DFG - Graduiertenkolleg, Effiziente Algorithmen und Mehrskalenmethoden; by the EU Thematic Network APPOL I + II, Approximation and Online Algorithms, IST-1999-14084 and IST-2001-32007; by the EU Research Training Network ARACNE, Approximation and Randomized Algorithms in Communication Networks, HPRN-CT-1999-00112; by the EU Project CRESCCO, Critical Resource Sharing for Cooperation in Complex Systems, IST-2001-33135. The second author was also supported by an MITACS grant of Canada; and by the NSERC Discovery Grant DG 5-48923.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jansen, K., Zhang, H. Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math. Program. 114, 183–206 (2008). https://doi.org/10.1007/s10107-007-0106-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-007-0106-8

Mathematics Subject Classification (2000)

Search

Navigation