Bucket game with applications to set multicover and dynamic page migration

Authors:
Marcin Bienkowski;Jarosław Byrka
Affiliations:
International Graduate School of Dynamic Intelligent Systems, University of Paderborn, Germany;Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 10
Cited 1

Amortized efficiency of list update and paging rules

Communications of the ACM
On the power of randomization in online algorithms

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing
On page migration and other relaxed task systems

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation algorithms for combinatorial problems

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Fighting against two adversaries: page migration in dynamic networks

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Improved algorithms for dynamic page migration

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Optimal algorithms for page migration in dynamic networks

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.01

Visualization

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.