Review Article

Finding -Hub Median Locations: An Empirical Study on Problems and Solution Techniques

Algorithm 1

Random Prim algorithm for finding a connective hub network.
  Input hub set H, empty link set , complete link set links in complete graph of H,
empty hub set , set , number of hubs p, number of hub links q.
  if :
links in complete graph of H
  else:
choose a hub u from randomly
while :
choose a hub from and a hub v from randomly
generate a link
endwhile
choose links from randomly, marked as
  endif
  Output the set hub hub links