Abstract
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one in an online fashion. In an online packing problem the profit function as well as the exact packing constraints are not fully known in advance. In each round additional information about the profit function and the constraints is revealed. We provide general deterministic schemes for online fractional covering and packing problems. We also provide deterministic algorithms for a couple of integral covering and packing problems.
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
Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: The 35th annual ACM Symp. on the Theory of Computation (2003)
Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. In: SODA (2004)
Awerbuch, B., Azar, Y., Bartal, Y.: On-line generalized steiner problem. In: Proc. of the 7th Ann. ACM-SIAM Symp. on Discrete Algorithms (1996)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: Proc. of 34th FOCS, pp. 32–40 (1993)
Berman, P., Coulston, C.: On-line algorithms for steiner tree problems. In: Proc. of the 29th annual ACM Symp. on the Theory of Computation (1997)
Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: SODA 2004, pp. 1001–1010 (2004)
Fleischer, L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics (2000)
Garg, N., Khandekar, R.: Fractional covering with upper bounds on the variables: Solving lps with negative entries. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 371–382. Springer, Heidelberg (2004)
Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: FOCS 1998, pp. 300–309 (1998)
Imase, M., Waxman, B.: Dynamic steiner tree problem. SIAM Journal Discrete Math. 4, 369–384 (1991)
Kolliopoulos, S.G., Young, N.E.: Tight approximation results for general covering integer programs. In: FOCS 2001, pp. 522–528 (2001)
Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37(2), 130–143 (1988)
Raghavan, P., Thompson, C.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365–374 (1987)
Plotkin, E.T.S., Shmoys, D.: Fast approximation algorithms for fractional packing and covering problems. Math. of Operations Research 20, 257–301 (1995)
Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing 29(2), 648–670 (1999)
Young, N.E.: Randomized rounding without solving the linear program. In: Proc. of the 6th annual ACM-SIAM symp. on Discrete algorithms, pp. 170–178 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchbinder, N., Naor, J. (2005). Online Primal-Dual Algorithms for Covering and Packing Problems. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_61
Download citation
DOI: https://doi.org/10.1007/11561071_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)