Abstract
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c (1 + ε)-approximation algorithm for the general packing problem was proposed. A block solver ABS(bip,ε/6, c) with price vector p, given accuracy ε and ratio c is required. In addition, in [Villavicencio and Grigoriadis, Network Optimization (1997)] a (1 + ε)-approximation algorithm for standard packing problem and its dual problem was studied, with a block solver ABS(p,O(ε/10) (i.e., c = 1). In this paper we develop c(1+ε)-approximation algorithms for the general packing problem (or with its dual problem), with only weaker block solvers ABS(p, O(ε′),c) with same structure as in previous algorithms, where ε′ > ε. For both primal and dual problems we design an algorithm with an ABS(p, ε/10, c) and ε 1 > ε. The bound on the number of iterations is polynomial in M, ε and c. Furthermore we show an algorithm for the primal problem with an ABS(p, ε 3 /6, c) and ε3 > ε. And the bound on the number of iterations is polynomial in only M and ε. In both cases running times are further improved with corresponding weaker block solvers. This is the first attempt to solve the packing problem with weaker block solvers.
Chapter PDF
References
A. Baltz and A. Srivastav, Fast Approximation of Minimum Multicast Congestion-Implementation versus Theory, Proceedings of 5th Conference on Algorithms and Complexity, CIAC 2003.
M. Charikar, C. Chekuri, A. Goel, S. Guha and S. Plotkin, Approximating a finite metric by a small number of tree metrics, Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, 379–388.
G. Even, J. S. Naor, S. Rao and B. Schieber, Fast approximate graph partitioning algorithms, SIAM. Journal on Computing, 6 (1999), 2187–2214.
N. Garg and J. Könemann, Fast and simpler algorithms for multicommodity flow and other fractional packing problems, Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1998, 300–309.
M. D. Grigoriadis and L. G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM Journal on Optimization, 4 (1994), 86–107.
M. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research, 2 (1996), 321–340.
M. D. Grigoriadis and L. G. Khachiyan, Approximate minimum-cost multicommodity flows in O(ε −2 knm) time, Mathematical Programming, 75 (1996), 477–482.
M. D. Grigoriadis, L. G. Khachiyan, L. Porkolab and J. Villavicencio, Approximate max-min resource sharing for structured concave optimization, SIAM Journal on Optimization, 11 (2001), 1081–1091.
K. Jansen, Approximation algorithms for fractional covering and packing problems, and applications, Manuscript, (2001).
K. Jansen, Approximation algorithms for the general max-min resource sharing problem: faster and simpler, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT 2004, LNCS.
K. Jansen, Approximation algorithms for the mixed fractional packing and covering problem, these proceedings.
K. Jansen and L. Porkolab, On preemptive resource constrained scheduling:polynomial-time approximation schemes, Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, LNCS 2337 329–349.
K. Jansen and R. Solis-Oba, An asymptotic fully polynomial time approximation scheme for bin covering, Proceedings of 13th International Symposium on Algorithms and Computation, ISAAC 2002.
K. Jansen and H. Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, Proceedings of 2 nd IFIP International Conference on Theoretical Computer Science, TCS 2002.
K. Jansen and H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, Proceedings of 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks, ARANCE 2002.
C. Kenyon and E. Rémila, Approximate strip packing, Proceedings of 37 th Annual Symposium on Foundations of Computer Science, FOCS 1996, 31–36.
S. A. Plotkin, D. B. Shmoys and E. Tardos, Fast Approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 2 (1995), 257–301.
J. Villavicencio and M. D. Grigoriadis, Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, Network Optimization, P. Pardalos, D. W. Hearn and W. W. Hager, Eds, Lecture Notes in Economics and Mathematical Systems 450, Springer-Verlag, Berlin, (1997), 471–485.
D. Ye and H. Zhang The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces, Proceedings of the 11th Colloquium on Structural Information and Communication Complexity Sirocco 2004, LNCS.
N. E. Young, Randomized rounding without solving the linear program, Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, 170–178.
N. E. Young, Sequential and parallel algorithms for mixed packing and covering, Proceedings of the 42 nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 538–546.
H. Zhang, Packing: Scheduling, Embedding and Approximating Metrics, Proceedings of the 2004 International Conference on Computational Science and its Applications ICCSA 2004, LNCS 3045.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Zhang, H. (2004). Solving Packing Problem with Weaker Block Solvers. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_24
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive