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]
@inproceedings{GandhiKPS02,
title = {Dependent Rounding in Bipartite Graphs},
author = {Rajiv Gandhi and Samir Khuller and Srinivasan Parthasarathy 0002 and Aravind Srinivasan},
year = {2002},
doi = {10.1109/SFCS.2002.1181955},
url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181955},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GandhiKPS02},
cites = {0},
citedby = {0},
pages = {323-332},
booktitle = {43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-1822-2},
}