Re: To which field does this belong?
- From: Duncan Muirhead <noone@xxxxxxxxxxxx>
- Date: Fri, 22 Sep 2006 16:56:47 +0100
On Fri, 22 Sep 2006 07:53:01 -0700, sol.hari wrote:
Which field of mathematics would describe an algorithm to solve theThis is the set cover problem. Search for that in Wikipedia for example.
problem below? What keywords should I use to point me in the right
direction?
Problem:
I have a set of n distinct elements T = {e_1, e_2, ..., e_n}, and m
subsets of T, S_1, S2, ... S_m, that can overlap.
I need to find the minimum number of subsets whose union equals T.
Thanks,
Hari
This is a (np) hard problem.
Duncan
.
- Follow-Ups:
- Re: To which field does this belong?
- From: kunzmilan
- Re: To which field does this belong?
- References:
- To which field does this belong?
- From: sol . hari
- To which field does this belong?
- Prev by Date: Sort the data of a moving window
- Next by Date: Re: JSH: What if? Academic nightmare supposition
- Previous by thread: Re: To which field does this belong?
- Next by thread: Re: To which field does this belong?
- Index(es):
Relevant Pages
|