# Set cover problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- JoCG
- 2012

We study several set cover problems in low dimensional geometric settings. Specifically, we describe a PTAS for the problem ofâ€¦Â (More)

Is this relevant?

2011

2011

- Theor. Comput. Sci.
- 2011

A flaw in the greedy approximation algorithm proposed by Zhan g et al. for minimum connected set cover problem is corrected, andâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- SIAM J. Comput.
- 2009

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â€¦Â (More)

Is this relevant?

2009

2009

- Theor. Comput. Sci.
- 2009

Given a set V of elements, S a family of subsets of V , and G a connected graph on vertex set S,a connected set cover (CSC) is aâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- ICDT
- 2005

A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provideâ€¦Â (More)

Is this relevant?

2004

2004

- ICALP
- 2004

We consider the minimum entropy principle for learning data generated by a random source and observed with random noise. In ourâ€¦Â (More)

Is this relevant?

2003

2003

- STOC
- 2003

Let <i>X=[1,2,â€¢â€¢â€¢,n]</i> be a ground set of <i>n</i> elements, and let <i>S</i> be a family of subsets of <i>X</i>, <i>|S|=m</iâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Algorithmica
- 2002

The input to the min sum set cover problem is a collection of n sets that jointly cover m elements. The output is a linear orderâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- SODA
- 2000

Given a nite set of \red" elements R, a nite set of \blue" elements B and a family S 2 RB , the red-blue set cover problem is toâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- Complexity of Computer Computations
- 1972

A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integersâ€¦Â (More)

Is this relevant?