need math help to find the largest disjoint set from 56 sets

User Generated

antsyne

Mathematics

Description

need to find the largest disjoint set from 56 sets

User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

Thank you for the opportunity to help you with your question!

This is the largest set of non-overlapping shapes selected from a given set of candidates who are well organised.


Given a set  of 56, an approximation to MDS(C) can be found by the following 

I have opted to use greedy algorithm

  • Initialize an empty set, S.
  • SEARCH: For every shape x in 56:
    1. Calculate N(x) - the subset of all shapes in C that intersect x (including x itself).
    2. Calculate the largest independent set in this subset: MDS(N(x)).
    3. Select an x such that |MDS(N(x))| is minimized.
  • Add x to S.
  • Remove x and N(x) from C.
  • If there are shapes in C, go back to Search.
  • END: return the set S.



Please let me know if you need any clarification. I'm always happy to answer your questions.


Anonymous
I use Studypool every time I need help studying, and it never disappoints.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags