Convert a soft transport plan from sinkhorn() to a hard 1-to-1 assignment
using greedy rounding.
Arguments
- result
Either a result from
sinkhorn()or a transport plan matrix.
Details
Greedy rounding iteratively assigns each row to its most probable column,
ensuring no column is assigned twice. This may not give the globally optimal
hard assignment; for that, use the transport plan as a cost matrix with
assignment().