A fast approximation algorithm for the multicovering problem

From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Strengthening integrality gaps for capacitated network design and covering problems

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Measuring the Effects of Data Distribution Models on Performance Evaluation of Distributed Database Systems

IEEE Transactions on Knowledge and Data Engineering

Admission control with advance reservations in simple networks

Journal of Discrete Algorithms

Greedy ${\ensuremath{\Delta}}$-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I

Distributed and parallel algorithms for weighted vertex cover and other covering problems

Proceedings of the 28th ACM symposium on Principles of distributed computing

Approximating integer programs with positive right-hand sides

Information Processing Letters

Dynamic programming based algorithms for set multicover and multiset multicover problems

Theoretical Computer Science

Submodular integer cover and its application to production planning

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms

Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms

Discrete Optimization

LP-Based covering games with low price of anarchy

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics