Results 1  10
of
161,881
Algorithms for the Set Covering Problem
 Annals of Operations Research
, 1998
"... The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and masstransit companies. ..."
Abstract

Cited by 91 (4 self)
 Add to MetaCart
The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and masstransit companies.
The Probabilistic Set Covering Problem
 OPERATIONS RESEARCH
, 2001
"... In a probabilistic set covering problem the right hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyse the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enu ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
In a probabilistic set covering problem the right hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyse the structure of the set of probabilistically efficient points of binary random vectors, develop methods
The Online Set Cover Problem
 STOC'03
, 2003
"... Let X = {1, 2,...,n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives eleme ..."
Abstract

Cited by 64 (7 self)
 Add to MetaCart
Let X = {1, 2,...,n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives
On capacitated set cover problems
 APPROX
"... Abstract. Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and considered the question of how their approximability relates to that of the uncapacitated problem on the same underlying set system. Here, we investigate this connection further and give se ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and considered the question of how their approximability relates to that of the uncapacitated problem on the same underlying set system. Here, we investigate this connection further and give
The Online Set Cover Problem
"... Let X = {1, 2,..., n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈ S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives ele ..."
Abstract
 Add to MetaCart
Let X = {1, 2,..., n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈ S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives
Solving Hard Set Covering Problems
 OPERATIONS RESEARCH LETTERS
, 1995
"... We propose a new branchandbound algorithm to solve hard instances of set covering problems arising from Steiner triple systems ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
We propose a new branchandbound algorithm to solve hard instances of set covering problems arising from Steiner triple systems
The pipelined set cover problem
, 2003
"... A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered and the ..."
Abstract

Cited by 37 (7 self)
 Add to MetaCart
A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered
Set Covering Problem
, 2003
"... Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité deleurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies. Solution Techniques for the Large ..."
Abstract
 Add to MetaCart
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité deleurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies. Solution Techniques for the Large
A betterthangreedy approximation algorithm for the minimum set cover problem
 SIAM J. Comput
, 2006
"... set cover problem ..."
Results 1  10
of
161,881