Skip to main content
SpringerLink
Log in

An approximation algorithm for the general max-min resource sharing problem

  • Published:
Mathematical Programming Submit manuscript

Abstract

We propose an approximation algorithm for, the general max-min resource sharing problem with M nonnegative concave constraints on a convex set B. The algorithm is based on a Lagrangian decomposition method and it uses a c-approximation algorithm (called approximate block solver) for a simpler maximization problem over the convex set B. We show that our algorithm achieves within iterations or calls to the approximate block solver a solution for the general max-min resource sharing problem with approximation ratio The algorithm is faster and simpler than the previous known approximation algorithms for the problem [12, 13]

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. Aizatulin, M., Diedrich, F., Jansen, K.: Implementation of approximation algorithms for the max-min resource sharing problem. Unpublished manuscript

  2. Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J.: Scheduling under resource constraints – deterministic models. Ann. Oper. Res. 7, 1986

  3. Bienstock, D.: Potential function methods for approximately solving linear programming problems: Theory and practive, Kluwer, Boston, 2002

  4. Caragiannis, I., Ferreira, A., Kaklamanis, C., Perennes, S., Rivano, H.: Fractional path coloring with applications to WDM networks, Proceedings 28th International Colloquium on Automata, Languages, and Programming, ICALP 2001, LNCS 2076, pp. 732–743

  5. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. Proceedings 39th IEEE Symposium on Foundations of Computer Science, FOCS, 1998, pp. 379–388

  6. Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds, Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 1001–1010

  7. Garg, N., Könemann, J.: Fast and simpler algorithms for multicommodity flow and other fractional packing problems. Proceedings 39th IEEE Symposium on Foundations of Computer Science, FOCS, 1998, pp. 300–309

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  10. Grigoriadis, M.D., Khachiyan, L.G., Porkolab, L., Villavicencio, J.: Approximate max-min resource sharing for structured concave optimization. SIAM J. Optimization 41, 1081–1091 (2001)

    Article  MathSciNet  Google Scholar 

  11. Jansen, K.: Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica 39, 59–81 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Jansen, K.: Improved approximation algorithms for the general max-min resource sharing and fractional covering problem. Unpublished manuscript

  13. Jansen, K., Porkolab, L.: On preemptive resource constrained scheduling: polynomial-time approximation schemes. Proceedings 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, LNCS 2337, pp. 329–349

  14. Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. Proceedings 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, Kluwer Publisher, pp. 255–266

  15. Kenyon C., Remila, E.: Approximate strip packing. Math. Oper. Res. 25, 645–656 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Klein, P., Young, N.: On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Proceedings 7th International Conference on Integer Programming and Combinatorial Optimization, IPCO 1999, LNCS 1610, pp. 320–327

  17. Könemann, J.: Fast combinatorial algorithms for packing and covering problems, Diploma Thesis, Max-Planck-Institute for Computer Science Saarbrücken, 2000

  18. Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task scheduling algorithms for a model of multiprogramming computer systems. J. ACM 22, 522–550 (1975) and Errata, J. ACM 24, 527 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  19. Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. Proceedings Symposium on Discrete and Compuational Geometry 2000, LNCS 1763, pp. 194–200

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Schreinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs, Wiley Interscience Series in Discrete Mathematics, 1997

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

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

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

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Universität zu Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Klaus Jansen.

Additional information

Research of the author was supported in part by EU Thematic Network APPOL, Approximation and Online Algorithms, IST-2001-30012, by EU Project CRESCCO, Critical Resource Sharing for Cooperation in Complex Systems, IST-2001-33135 and by DFG Project, Entwicklung und Analyse von Approximativen Algorithmen für Gemischte und Verallgemeinerte Packungs- und Überdeckungsprobleme, JA 612/10-1. Part of this work was done while visiting the Department of Computer Science at ETH Zürich.

An extended abstract of this paper appeared in SWAT 2004, Scandinavian Workshop on Algorithm Theory, LNCS 3111, 311–322.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jansen, K. An approximation algorithm for the general max-min resource sharing problem. Math. Program. 106, 547–566 (2006). https://doi.org/10.1007/s10107-005-0669-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-005-0669-1

Keywords

Search

Navigation