Minimal Covering Set: System of Distinct Representatives

  • A
  • Thread starter WWGD
  • Start date
  • Tags
    Set
In summary, a minimal covering set is a set of elements that covers all the elements of another set with the minimum number of elements possible. It is used in solving problems related to set theory, combinatorics, and scheduling. The calculation of a minimal covering set involves finding a system of distinct representatives using algorithms such as the greedy algorithm, the branch-and-bound method, or the linear programming method. Minimal covering sets have applications in mathematics, computer science, operations research, and real-world fields such as logistics and supply chain management.
  • #1
WWGD
Science Advisor
Gold Member
7,032
10,618
Hi All,
Let ##s: \{s_1,s_2,...,s_j \}## be a collection of elements contained in the sets ##S:=\{S_1,S_2,...S_k \}## , no relation between ##j,k##; a given ##s_i## may be contained in one or more ##S_n##. I want to find a minimal "cover" for ##s##, i.e., the smallest subcollection of sets in ##S## that contains every element in ##s##. I think this is called an SDR : System of Distinct Representatives.
Is there a general formula dealing with this? Obviously, ##k## is an upper bound.
 
Physics news on Phys.org
  • #2
  • Like
Likes WWGD

Related to Minimal Covering Set: System of Distinct Representatives

What is a minimal covering set?

A minimal covering set is a set of elements that covers all the elements of another set with the minimum number of elements possible. In other words, it is the smallest set that contains at least one element from each subset of a larger set.

What is a system of distinct representatives?

A system of distinct representatives is a collection of elements that are chosen from different sets in a way that each element is unique and no two elements are chosen from the same set. This system is used to solve problems related to finding a minimal covering set.

What is the significance of a minimal covering set?

A minimal covering set is significant because it helps in solving various problems related to set theory, combinatorics, and scheduling. It is used in tasks such as scheduling exams, assigning tasks to workers, and creating tournament schedules.

How is a minimal covering set calculated?

The calculation of a minimal covering set involves finding a system of distinct representatives for a given set. This can be done using various algorithms such as the greedy algorithm, the branch-and-bound method, or the linear programming method.

What are the applications of minimal covering sets?

Minimal covering sets have various applications in mathematics, computer science, and operations research. They are used in scheduling problems, database design, graph theory, and network flow optimization. They also have real-world applications in fields like logistics, transportation, and supply chain management.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
972
  • Set Theory, Logic, Probability, Statistics
Replies
20
Views
1K
  • Calculus and Beyond Homework Help
Replies
12
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
27
Views
3K
Replies
16
Views
2K
  • Calculus
Replies
3
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
6K
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
Back
Top