## A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems (2001)

### Cached

### Download Links

- [www.math.tau.ac.il]
- [www.aladdin.cs.cmu.edu]
- [www.math.cmu.edu]
- [ftp.cs.princeton.edu]
- [www.cs.princeton.edu]
- DBLP

### Other Repositories/Bibliography

by
Sanjeev Arora
,
Alan Frieze
,
Haim Kaplan

Citations: | 74 - 3 self |

### BibTeX

@MISC{Arora01anew,

author = {Sanjeev Arora and Alan Frieze and Haim Kaplan},

title = {A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems},

year = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satis es any linear inequality, then with high probability, the new matching satis es that linear inequality in an approximate sense. This extends the well-known LP rounding procedure of Raghavan and Thompson, which is usually used to round fractional solutions of linear programs.