Re: To which field does this belong?
- From: magidin@xxxxxxxxxxxxxxxxx (Arturo Magidin)
- Date: Fri, 22 Sep 2006 14:56:09 +0000 (UTC)
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...
--
======================================================================
"It's not denial. I'm just very selective about
what I accept as reality."
--- Calvin ("Calvin and Hobbes" by Bill Watterson)
======================================================================
Arturo Magidin
magidin-at-member-ams-org
.
- Follow-Ups:
- Re: To which field does this belong?
- From: Randy Poe
- 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: To which field does this belong?
- Next by Date: Re: An integral inequality
- Previous by thread: To which field does this belong?
- Next by thread: Re: To which field does this belong?
- Index(es):
Relevant Pages
|