Sciweavers

Share
IPL
2008
135views more  IPL 2008»
8 years 3 months ago
On the Positive-Negative Partial Set Cover problem
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...
Pauli Miettinen
SIROCCO
2010
8 years 4 months ago
On the Impact of Local Taxes in a Set Cover Game
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 ...
Bruno Escoffier, Laurent Gourvès, Jé...
COLING
2008
8 years 4 months ago
Detecting Multiple Facets of an Event using Graph-Based Unsupervised Methods
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...
Pradeep Muthukrishnan, Joshua Gerrish, Dragomir R....
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
8 years 7 months ago
Tight Results on Minimum Entropy Set Cover
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...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
8 years 8 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
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 ...
Kasturi Varadarajan
FSTTCS
2005
Springer
8 years 9 months ago
The Set Cover with Pairs Problem
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...
Refael Hassin, Danny Segev
ESA
2005
Springer
140views Algorithms» more  ESA 2005»
8 years 9 months ago
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
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 ...
Marcin Bienkowski, Jaroslaw Byrka
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
8 years 9 months ago
Connected Set Cover Problem and Its Applications
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...
Tianping Shuai, Xiao-Dong Hu
COMPGEOM
2009
ACM
8 years 10 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...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
8 years 10 months ago
Cartesian contour: a concise representation for a collection of frequent sets
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...
Ruoming Jin, Yang Xiang, Lin Liu
books