Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...