Sciweavers

1272 search results - page 6 / 255
» The Set Cover with Pairs Problem
Sort
View
MP
2010
79views more  MP 2010»
13 years 6 months ago
MIP reformulations of the probabilistic set covering problem
Anureet Saxena, Vineet Goyal, Miguel A. Lejeune
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue
COMPGEOM
2009
ACM
14 years 2 months ago
On the set multi-cover problem in geometric settings
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...
IPL
2006
83views more  IPL 2006»
13 years 7 months ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...