Skip to content

A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems.

Sanjeev Arora, Alan M. Frieze, Haim Kaplan

VenueA*FOCS
Year1996
ProceedingsFOCS

Browse the full FOCS paper archive.