Aleksander Madry. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 245-254, IEEE Computer Society, 2010. [doi]
@inproceedings{Madry10-0,
title = {Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs},
author = {Aleksander Madry},
year = {2010},
doi = {10.1109/FOCS.2010.30},
url = {http://dx.doi.org/10.1109/FOCS.2010.30},
tags = {rule-based, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Madry10-0},
cites = {0},
citedby = {0},
pages = {245-254},
booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-4244-7},
}