A new rounding procedure for the assignment problem with applications to dense graph arrangement problems