Minimum Cost to Connect Two Groups of Points

Select edges in a bipartite graph (given by a cost matrix) so every vertex in both groups is connected to at least one opposite vertex and the total cost is minimized. With sizes ≤12 and unlimited degree, this is typically solved by bitmask DP over the smaller group to track which second-group points are already covered.