title: Algorithm for Node connectivity optimization
body: <p>I have an interesting problem i'm trying to solve. Let me explain the problem first.</p>
  
  <p>A node can assume a role of master or slave.</p>
  
  <ul>
  <li><p>The rule of the slave is that, they can connect to only one master.
  Slaves only select masters that are closest to them (lets say x
  meters). </p></li>
  <li><p>The master is free to connect to multiple slaves (as long as the
  slaves are &lt; x meters from the master). A master cannot connect to
  another master. A slave cannot connect to another slave. Given a
  arbitrary number of nodes and their locations, the goal is to come up
  with optimal role assignment (master or slave) to each node so that
  the overall connectivity (i.e. number of connections) are increased.</p></li>
  </ul>
  
  <p>Is there any well researched algorithms for these types of problems? </p>
  
  <p>My initial thoughts to see if i can model this problem as graph theory problem and try to solve. </p>
  
  <p>Any pointers on what algorithms would be applicable for this problem? </p>