Databases
StackOverflow2013
Postsdbo
POWeighted bipartite matching with constraints on degrees of vertices
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POWeighted bipartite matching with constraints on degrees of vertices
    primarykey
    data
    text
    <p>I have a problem that I was able to conceptualize as following:</p> <p>We have a set of <em>n</em> people. And <em>m</em> subsets representing their ethnicity like White, Hispanic, Asian etc. Given any combination of these people, I want to check if it is a diverse group. </p> <p>A diverse group is a group that satisfies several requirements, each requirement is of the form "at least <em>Ki</em> persons in the group belong to subset <em>Si</em>". Here is the tricky part, one person can only be used to satisfy one requirement. As in, you can't use him/her for multiple requirements.</p> <p>An example:</p> <p>Given:</p> <p>At least two people from Hispanic= {a,b,c}</p> <p>At least two people from Asian={a,d,e} </p> <p>Is the group {a,c,d} a diverse group?</p> <p>The group {a,c,d} is not diverse because you cant count <em>a</em> as Hispanic and Asian. But, the group {a,c,d,e,f} is diverse because we have two Hispanics a and c and two Asian d and e.</p> <h2>Attempt:</h2> <p>This is an instance of the Assignment problem. The jobs are the ethnicity and we can put as many ethnicity as the requirement dictate. For example, if we need two Hispanic, then we put two Hispanic jobs. However there only some people are able to do a particular job. </p> <p>This is my attempt so far:</p> <p>I will construct a bipartite graph with the set of people <strong>P</strong> on one hand and the set of ethnicity on the other <strong>S</strong>. We will put an edge between a person <strong>p_i</strong> and an ethnicity <strong>S_i</strong> if he/she belongs to the ethnicity. Now, we will modify the graph, for every ethnicity <strong>S_i</strong> duplicate it <strong>k_i</strong> times (<strong>S_{i,1}, S_{i,2}, ... , S_{i,k_i}</strong>). And add new edges accordingly. Find the maximum matching M of this graph. </p> <p>Now, merge the <strong>S_{i,j}</strong> s into one <strong>S_i</strong> and there you have a diverse group. However, a maximum matching is only a possible solution to to the problem. And my problem is a decision problem, I want to check if a given group is a solution or not. </p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USuser2038833
    1. USuser2038833
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POWeighted bipartite matching with constraints on degrees of vertices
      1. This table or related slice is empty.
      1. VTUpMod
    1. COAsian is White?
      singulars
      1. POWeighted bipartite matching with constraints on degrees of vertices
      1. USAlex Filipovici
    2. CODo you mean _at least Ki persons in the group (can) belong to Si different subsets_?
      singulars
      1. POWeighted bipartite matching with constraints on degrees of vertices
      1. USangelatlarge
    3. CO@angelatlarge, I mean Ki persons belong to the set Si.
      singulars
      1. POWeighted bipartite matching with constraints on degrees of vertices
      1. USuser2038833
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload