Amir Abboud, Robert Krauthgamer, Ohad Trabelsi. New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 48-61, SIAM, 2020. [doi]
@inproceedings{AbboudKT20,
title = {New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs},
author = {Amir Abboud and Robert Krauthgamer and Ohad Trabelsi},
year = {2020},
doi = {10.1137/1.9781611975994.4},
url = {https://doi.org/10.1137/1.9781611975994.4},
researchr = {https://researchr.org/publication/AbboudKT20},
cites = {0},
citedby = {0},
pages = {48-61},
booktitle = {Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020},
editor = {Shuchi Chawla 0001},
publisher = {SIAM},
isbn = {978-1-61197-599-4},
}