Re: To which field does this belong?
- From: "Randy Poe" <poespam-trap@xxxxxxxxx>
- Date: 22 Sep 2006 08:14:22 -0700
Arturo Magidin wrote:
In article <1158936781.323889.76850@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
<sol.hari@xxxxxxxxx> 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.
Sounds like combinatorics and/or discrete math to me...
Or possibly as an integer programming optimization problem.
- Randy
.
- References:
- To which field does this belong?
- From: sol . hari
- Re: To which field does this belong?
- From: Arturo Magidin
- To which field does this belong?
- Prev by Date: Re: If it maybe possible?
- Next by Date: Re: Set with a single point boundary
- Previous by thread: Re: To which field does this belong?
- Next by thread: Re: To which field does this belong?
- Index(es):
Relevant Pages
|
