Dependent Rounding in Bipartite Graphs

Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan. Dependent Rounding in Bipartite Graphs. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings. pages 323-332, IEEE Computer Society, 2002. [doi]

Abstract

Abstract is missing.