Re: To which field does this belong?
- From: "Hari" <sol.hari@xxxxxxxxx>
- Date: 22 Sep 2006 08:18:59 -0700
Well, I figured it out. It's called the "Set cover problem"
Hari wrote:
Which field of mathematics would describe an algorithm to solve the
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
.
- References:
- To which field does this belong?
- From: Hari
- To which field does this belong?
- Prev by Date: To which field does this belong?
- Next by Date: Re: (Probably flawed) Polynomial time Graph Isomorphism
- Previous by thread: To which field does this belong?
- Index(es):
Relevant Pages
|
