IPL
2008
13 years 4 months ago
2008
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...
SIROCCO
2010
13 years 5 months ago
2010
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
COLING
2008
13 years 5 months ago
2008
We propose a new unsupervised method for topic detection that automatically identifies the different facets of an event. We use pointwise Kullback-Leibler divergence along with th...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
FSTTCS
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
ESA
2005
Springer
13 years 9 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
AAIM
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
COMPGEOM
2009
ACM
13 years 10 months ago
2009
ACM
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...
KDD
2009
ACM
13 years 11 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...