Abstract
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation algorithm for a generalization of the well known Set Cover problem, where we need to cover each element by at least k sets. Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration problem achieving the optimal competitive ratio against an oblivious adversary.
Extended abstract. The full version of this paper is available under http://wwwhni. upb.de/publikationen/.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bartal, Y., Charikar, M., Indyk, P.: On page migration and other relaxed task systems. In: Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 43–52 (1997)
Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. In: Proc. of the 22nd ACM Symp. on Theory of Computing (STOC), pp. 379–386 (1990)
Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 39–50. Springer, Heidelberg (2004)
Bienkowski, M., Dynia, M., Korzeniowski, M.: Improved algorithms for dynamic page migration. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 365–376. Springer, Heidelberg (2005)
Bienkowski, M., Korzeniowski, auf der Heide, F.M.: Fighting against two adversaries: Page migration in dynamic networks. In: Proc. of the 16th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 64–73 (2004)
Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University (1989)
Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proc. of the 9th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 228–248 (1998)
Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proc. of the 5th ACM Symp. on Theory of Computing (STOC), pp. 38–49 (1973)
Lovász, L.: On the ratio of the optimal integral and fractional covers. Discrete Mathematics 13, 383–390 (1975)
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Approximation Algorithms for Combinatorial Optimization Problems, pp. 229–242 (2002)
Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM Journal on Computing 28(2), 525–540 (1999)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pp. 475–484 (1997)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)
Westbrook, J.: Randomized algorithms for multiprocessor page migration. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 7, 135–150 (1992)
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
Bienkowski, M., Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. 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_72
Download citation
DOI: https://doi.org/10.1007/11561071_72
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)