Chandra Chekuri, Jan Vondrák, Rico Zenklusen. Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 1080-1097, SIAM, 2011. [doi]
@inproceedings{ChekuriVZ11,
title = {Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding},
author = {Chandra Chekuri and Jan Vondrák and Rico Zenklusen},
year = {2011},
url = {http://www.siam.org/proceedings/soda/2011/SODA11_081_chekuric.pdf},
researchr = {https://researchr.org/publication/ChekuriVZ11},
cites = {0},
citedby = {0},
pages = {1080-1097},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011},
editor = {Dana Randall},
publisher = {SIAM},
}