The Algorithm Filtering Claiming Matching Rounding o For each matched pair (j, j ), open 1 or 2 facilities in U j  U j o If there is an unmatched client j, open 0 or 1 facility in U j o For each facility i that is not inside any U j, open i with probability 1/m o Connect each client to its nearest open facility
{}