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 O(M ( ln M + ε − − 2 ln ε − − 1)) iterations or calls to the approximate block solver a solution for the general max-min resource sharing problem with approximation ratio c / (1 – ε). The algorithm is faster and simpler than the previous known approximation algorithms for the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J.: Scheduling under resource constraints - deterministic models. Annals of Operations Research 7 (1986)
Bienstock, D.: Potential function methods for approximately solving linear programming problems: Theory and practive. Kluwer, Boston (2002)
Caragiannis, I., Ferreira, A., Kaklamanis, C., Perennes, S., Rivano, H.: Fractional path coloring with applications to WDM networks. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 732–743. Springer, Heidelberg (2001)
Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings 39th IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 379–388 (1998)
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 (2004)
Garg, N., Könemann, J.: Fast and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings 39th IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 300–309 (1998)
Grigoriadis, M.D., Khachiyan, L.G.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization 4, 86–107 (1994)
Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel pricedirective decomposition. Mathematics of Operations Research 2, 321–340 (1996)
Grigoriadis, M.D., Khachiyan, L.G., Porkolab, L., Villavicencio, J.: Approximate max-min resource sharing for structured concave optimization. SIAM Journal on Optimization 41, 1081–1091 (2001)
Jansen, K.: Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 562–573. Springer, Heidelberg (2002)
Jansen, K.: Improved approximation algorithms for the general max-min resource sharing and fractional covering problem (unpublished manuscript)
Jansen, K., Porkolab, L.: On preemptive resource constrained scheduling: polynomial-time approximation schemes. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 329–349. Springer, Heidelberg (2002)
Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proceedings 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, pp. 255–266. Kluwer Publisher, Dordrecht (2002)
Kenyon, C., Remila, E.: Approximate strip packing. Mathematics of Operations Research 25, 645–656 (2000)
Könemann, J.: Fast combinatorial algorithms for packing and covering problems, Diploma Thesis, Max-Planck-Institute for Computer Science Saarbrücken (2000)
Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 22 (1975)522-550 , Errata, Journal of the ACM 24, 527(1977)
Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 194–200. Springer, Heidelberg (2000)
Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20, 257–301 (1995)
Schreinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley Interscience Series in Discrete Mathematics (1997)
Villavicencio, J., Grigoriadis, M.D.: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W., Hager, W.W. (eds.) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 450, pp. 471–485. Springer, Berlin (1997)
Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings 6th ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 170–178 (1995)
Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings 42nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2001, pp. 538–546 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, K. (2004). Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive