Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well

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]

Authors

Kenneth A. Berman

This author has not been identified. Look up 'Kenneth A. Berman' in Google

Chad Yoshikawa

This author has not been identified. Look up 'Chad Yoshikawa' in Google