Minimax Algorithm

• Extension of Prim’s MST algorithm

• Uses graph-partitioning for declustering

  • model problem as a complete graph
  • vertices represent data blocks
  • edge weights computed from proximity index
  • expands multiple trees in round-robin order
  • heuristic to include least similar vertex