Kenneth A. Berman, Chad Yoshikawa. Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. In Hung Q. Ngo, editor, Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings. Volume 5609 of Lecture Notes in Computer Science, pages 368-377, Springer, 2009. [doi]
@inproceedings{BermanY09,
title = {Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well},
author = {Kenneth A. Berman and Chad Yoshikawa},
year = {2009},
doi = {10.1007/978-3-642-02882-3_37},
url = {http://dx.doi.org/10.1007/978-3-642-02882-3_37},
tags = {data-flow},
researchr = {https://researchr.org/publication/BermanY09},
cites = {0},
citedby = {0},
pages = {368-377},
booktitle = {Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
editor = {Hung Q. Ngo},
volume = {5609},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-02881-6},
}