A fast approximation algorithm for the multicovering problem

Citations of this article
Mendeley users who have this article in their library.


The multicovering problem is: MIN cx subject to Ax≥b, xε{lunate}{0, 1}n, where A is a matrix whose elements are all zero or one and b is a vector of positive integers. We present a fast heuristic for this important class of problems and analyze its worst-case performance: the ratio of the heuristic value to the optimum does not exceed the maximum row sum of the matrix A. The heuristic algorithm also provides a feasible dual solution vector that is useful in generating lower bounds on the value of the optimum. © 1986.




Hall, N. G., & Hochbaum, D. S. (1986). A fast approximation algorithm for the multicovering problem. Discrete Applied Mathematics, 15(1), 35–40. https://doi.org/10.1016/0166-218X(86)90016-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free