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]

Authors

Rajiv Gandhi

This author has not been identified. Look up 'Rajiv Gandhi' in Google

Samir Khuller

This author has not been identified. Look up 'Samir Khuller' in Google

Srinivasan Parthasarathy 0002

This author has not been identified. Look up 'Srinivasan Parthasarathy 0002' in Google

Aravind Srinivasan

This author has not been identified. Look up 'Aravind Srinivasan' in Google