Abstract
We present a price-directive decomposition algorithm to compute an approximate solution of the mixed packing and covering problem; it either finds x ∈ B such that f(x) ≤ c(1 + ε)a and g(x) ≥ (1 − ε)b/c or correctly decides that {x ∈ B|f(x) ≤ a, g(x) ≥ b} = ∅. Here f,g are vectors of M ≥ 2 convex and concave functions, respectively, which are nonnegative on the convex compact set ∅ ≠ B ⊆ ℝN; B can be queried by a feasibility oracle or block solver, a, \(b\in \mathbb{R}^{M}_{++}\) and c is the block solver’s approximation ratio. The algorithm needs only O(M(ln M + ε − 2 ln ε − 1)) iterations, a runtime bound independent from c and the input data. Our algorithm is a generalization of [16] and also approximately solves the fractional packing and covering problem where f,g are linear and B is a polytope; there, a width-independent runtime bound is obtained.
Research supported in part by DFG Project “Entwicklung und Analyse von Approximativen Algorithmen für Gemischte und Verallgemeinerte Packungs- und Überdeckungsprobleme” JA 612/10-1, in part by EU Project AEOLUS IST-15964, and in part by a PPP funding “Scheduling in Communication Networks” D/05/06936 of the DAAD.
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
Aizatulin, M., Diedrich, F., Jansen, K.: Implementation of approximation algorithms for the max-min resource sharing problem. In: Àlvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 207–218. Springer, Heidelberg (2006)
Baille, F., Bampis, E., Laforest, C.: Bicriteria scheduling of parallel degradable tasks for network access under pricing constraints. In: INOC 2003. Proceedings of the International Network Optimization Conference, pp. 37–42 (2003)
Baille, F., Bampis, E., Laforest, C.: Maximization of the size and the weight of schedules of degradable intervals. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 219–228. Springer, Heidelberg (2004)
Bienstock, D.: Potential function methods for approximately solving linear programming problems: theory and practice. Kluwer Academic Publishers, Dordrecht (2002)
Bienstock, D., Iyengar, G.: solving fractional packing problems in O *(1/ε) iterations. In: STOC 2004. Proceedings of the 36th ACM Symposium on Theory of Computing, pp. 146–155 (2004)
Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: SODA 2000. Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 106–115 (2000)
Chudak, F.A., Eleutério, V.: Improved approximation schemes for linear programming relaxations of combinatorial optimization problems. In: Jünger, M., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 3509, pp. 81–96. Springer, Heidelberg (2005)
Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: SODA 2004. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 1001–1010. ACM Press, New York (2004)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: FOCS 1998. Proceedings of the 39th Annual IEEE Computer Society Conference on Foundations of Computer Science, pp. 300–309 (1998)
Garg, N., Khandekar, R.: Personal communication (2004)
Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research 2, 321–340 (1996)
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., Porkolab, L., Villavicencio, J.: Approximate max-min resource sharing for structured concave optimization. SIAM Journal on Optimization 41, 1081–1091 (2001)
Jansen, K.: Approximation algorithm for the general max-min resource sharing problem. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, Springer, Heidelberg (2004), Mathematical Programming Series A 106, 547–566 (2006), see also http://www.springerlink.com/content/fv2p781736gk4856/
Jansen, K.: Approximation algorithms for min-max and max-min resource sharing problems and applications. In: Bampis, E., Jansen, K., Kenyon, C. (eds.) Efficient Approximation and Online Algorithms. LNCS, vol. 3484, pp. 156–202. Springer, Heidelberg (2006)
Jansen, K.: Approximation algorithm for the mixed fractional packing and covering prob-lem. In: IFIP TCS 2004. Proceedings of the 3rd IFIP Conference on Theoretical Computer Science, pp. 223–236. Kluwer Publisher, Dordrecht (2004), SIAM Journal on Optimization, 17, 331–352 (2006)
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) and SIAM Journal on Discrete Mathematics 20, 545–563 (2006)
Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: TCS 2002. Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science. Foundations of information technology in the era of network and mobile computing, pp. 255–266. Kluwer, Dordrecht (2002)
Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems, PhD Thesis, Indian Institute of Technology, New Delhi (2004)
Knuth, D.E.: The art of computer programming, Volume I: Fundamental Algorithms. Addison-Wesley, Reading (1968)
Lu, Q., Zhang, H.: Implementation of approximation algorithms for the multicast congestion problem. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 152–164. Springer, Heidelberg (2005)
Villavicencio, J., Grigoriadis, M.D.: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 450, pp. 471–485. Springer, Heidelberg (1997)
Young, N.E.: personal communication (2004)
Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: FOCS 2001. Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 538–546 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diedrich, F., Jansen, K. (2007). An Approximation Algorithm for the General Mixed Packing and Covering Problem. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)