16404 search results - page 80 / 3281 » A set coverage problem |
96
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
103
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
124
click to vote
ANTSW
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
81
Voted
WALCOM
2010
IEEE
15 years 7 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
102
click to vote
GBRPR
2005
Springer
15 years 6 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...