Aaron Bernstein, David Karger. A nearly optimal oracle for avoiding failed vertices and edges. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. pages 101-110, ACM, 2009. [doi]
@inproceedings{BernsteinK09,
title = {A nearly optimal oracle for avoiding failed vertices and edges},
author = {Aaron Bernstein and David Karger},
year = {2009},
doi = {10.1145/1536414.1536431},
url = {http://doi.acm.org/10.1145/1536414.1536431},
researchr = {https://researchr.org/publication/BernsteinK09},
cites = {0},
citedby = {0},
pages = {101-110},
booktitle = {Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
editor = {Michael Mitzenmacher},
publisher = {ACM},
isbn = {978-1-60558-506-2},
}